./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test15-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_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 e1756e51675f6129782479a13cdab3bc8b369512 ............................................................................................................................................ 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_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 e1756e51675f6129782479a13cdab3bc8b369512 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 06:20:39,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:20:39,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:20:39,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:20:39,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:20:39,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:20:39,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:20:39,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:20:39,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:20:39,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:20:39,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:20:39,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:20:39,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:20:39,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:20:39,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:20:39,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:20:39,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:20:39,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:20:39,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:20:39,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:20:39,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:20:39,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:20:39,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:20:39,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:20:39,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:20:39,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:20:39,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:20:39,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:20:39,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:20:39,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:20:39,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:20:39,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:20:39,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:20:39,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:20:39,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:20:39,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:20:39,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:20:39,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:20:39,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:20:39,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:20:39,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:20:39,458 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 06:20:39,476 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:20:39,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:20:39,477 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:20:39,477 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:20:39,477 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:20:39,477 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:20:39,477 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 06:20:39,477 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:20:39,478 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:20:39,478 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 06:20:39,478 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 06:20:39,478 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:20:39,478 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 06:20:39,478 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 06:20:39,478 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 06:20:39,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 06:20:39,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 06:20:39,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:20:39,479 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:20:39,479 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 06:20:39,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:20:39,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:20:39,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:20:39,480 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 06:20:39,480 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 06:20:39,480 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 06:20:39,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:20:39,480 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:20:39,480 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:20:39,480 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:20:39,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:20:39,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:20:39,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:20:39,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:20:39,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:20:39,481 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 06:20:39,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 06:20:39,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:20:39,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:20:39,481 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_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 -> e1756e51675f6129782479a13cdab3bc8b369512 [2020-12-09 06:20:39,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:20:39,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:20:39,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:20:39,681 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:20:39,681 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:20:39,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2020-12-09 06:20:39,723 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data/2bfc65c20/9316443f3b594ffb8fca1153e570d1d3/FLAGbed05ceeb [2020-12-09 06:20:40,153 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:20:40,154 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2020-12-09 06:20:40,168 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data/2bfc65c20/9316443f3b594ffb8fca1153e570d1d3/FLAGbed05ceeb [2020-12-09 06:20:40,181 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data/2bfc65c20/9316443f3b594ffb8fca1153e570d1d3 [2020-12-09 06:20:40,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:20:40,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:20:40,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:20:40,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:20:40,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:20:40,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:20:40" (1/1) ... [2020-12-09 06:20:40,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160e1d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:40, skipping insertion in model container [2020-12-09 06:20:40,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:20:40" (1/1) ... [2020-12-09 06:20:40,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:20:40,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:20:40,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:20:40,500 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 06:20:40,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@440467d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:40, skipping insertion in model container [2020-12-09 06:20:40,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:20:40,501 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2020-12-09 06:20:40,503 INFO L168 Benchmark]: Toolchain (without parser) took 317.50 ms. Allocated memory is still 96.5 MB. Free memory was 54.8 MB in the beginning and 66.7 MB in the end (delta: -11.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2020-12-09 06:20:40,503 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 96.5 MB. Free memory is still 72.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:20:40,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.28 ms. Allocated memory is still 96.5 MB. Free memory was 54.6 MB in the beginning and 66.7 MB in the end (delta: -12.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2020-12-09 06:20:40,505 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.16 ms. Allocated memory is still 96.5 MB. Free memory is still 72.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 315.28 ms. Allocated memory is still 96.5 MB. Free memory was 54.6 MB in the beginning and 66.7 MB in the end (delta: -12.1 MB). Peak memory consumption was 9.6 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 06:20:41,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:20:41,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:20:41,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:20:41,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:20:41,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:20:41,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:20:41,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:20:41,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:20:41,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:20:41,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:20:41,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:20:41,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:20:41,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:20:41,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:20:41,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:20:41,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:20:41,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:20:41,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:20:41,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:20:41,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:20:41,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:20:41,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:20:41,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:20:41,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:20:41,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:20:41,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:20:41,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:20:41,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:20:41,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:20:41,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:20:41,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:20:41,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:20:41,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:20:41,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:20:41,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:20:41,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:20:41,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:20:41,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:20:41,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:20:41,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:20:41,918 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 06:20:41,938 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:20:41,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:20:41,939 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:20:41,939 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:20:41,939 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:20:41,939 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:20:41,939 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:20:41,939 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:20:41,940 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:20:41,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 06:20:41,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 06:20:41,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:20:41,941 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:20:41,941 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 06:20:41,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:20:41,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:20:41,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:20:41,941 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 06:20:41,941 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 06:20:41,942 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 06:20:41,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:20:41,942 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:20:41,942 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 06:20:41,942 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 06:20:41,942 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:20:41,942 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:20:41,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:20:41,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 06:20:41,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:20:41,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:20:41,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:20:41,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:20:41,943 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 06:20:41,943 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 06:20:41,944 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:20:41,944 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:20:41,944 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_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 -> e1756e51675f6129782479a13cdab3bc8b369512 [2020-12-09 06:20:42,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:20:42,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:20:42,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:20:42,223 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:20:42,224 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:20:42,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2020-12-09 06:20:42,270 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data/42f7b2f79/45343eca7eb4415e96581cc50317b02d/FLAGfedfd1209 [2020-12-09 06:20:42,700 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:20:42,701 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2020-12-09 06:20:42,715 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data/42f7b2f79/45343eca7eb4415e96581cc50317b02d/FLAGfedfd1209 [2020-12-09 06:20:42,727 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/data/42f7b2f79/45343eca7eb4415e96581cc50317b02d [2020-12-09 06:20:42,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:20:42,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:20:42,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:20:42,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:20:42,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:20:42,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:20:42" (1/1) ... [2020-12-09 06:20:42,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b26d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:42, skipping insertion in model container [2020-12-09 06:20:42,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:20:42" (1/1) ... [2020-12-09 06:20:42,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:20:42,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:20:43,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:20:43,038 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-12-09 06:20:43,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:20:43,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:20:43,089 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 06:20:43,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:20:43,205 INFO L208 MainTranslator]: Completed translation [2020-12-09 06:20:43,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43 WrapperNode [2020-12-09 06:20:43,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:20:43,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 06:20:43,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 06:20:43,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 06:20:43,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... [2020-12-09 06:20:43,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... [2020-12-09 06:20:43,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 06:20:43,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 06:20:43,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 06:20:43,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 06:20:43,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... [2020-12-09 06:20:43,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... [2020-12-09 06:20:43,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... [2020-12-09 06:20:43,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... [2020-12-09 06:20:43,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... [2020-12-09 06:20:43,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... [2020-12-09 06:20:43,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... [2020-12-09 06:20:43,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 06:20:43,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 06:20:43,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 06:20:43,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 06:20:43,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-12-09 06:20:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 06:20:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 06:20:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 06:20:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 06:20:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-12-09 06:20:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-12-09 06:20:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 06:20:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 06:20:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 06:20:43,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 06:20:43,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 06:20:43,850 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2020-12-09 06:20:43,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:20:43 BoogieIcfgContainer [2020-12-09 06:20:43,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 06:20:43,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 06:20:43,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 06:20:43,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 06:20:43,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:20:42" (1/3) ... [2020-12-09 06:20:43,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525abbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:20:43, skipping insertion in model container [2020-12-09 06:20:43,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:20:43" (2/3) ... [2020-12-09 06:20:43,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525abbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:20:43, skipping insertion in model container [2020-12-09 06:20:43,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:20:43" (3/3) ... [2020-12-09 06:20:43,856 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test15-1.i [2020-12-09 06:20:43,866 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 06:20:43,869 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 50 error locations. [2020-12-09 06:20:43,876 INFO L253 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2020-12-09 06:20:43,890 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 06:20:43,890 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 06:20:43,890 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 06:20:43,890 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 06:20:43,890 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 06:20:43,890 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 06:20:43,890 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 06:20:43,890 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 06:20:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2020-12-09 06:20:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 06:20:43,906 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:43,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 06:20:43,907 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash 889476117, now seen corresponding path program 1 times [2020-12-09 06:20:43,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:43,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814319942] [2020-12-09 06:20:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:43,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:20:43,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:44,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 06:20:44,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:44,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814319942] [2020-12-09 06:20:44,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:44,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:20:44,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695138135] [2020-12-09 06:20:44,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:20:44,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:44,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:20:44,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:20:44,065 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 5 states. [2020-12-09 06:20:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:44,164 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2020-12-09 06:20:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:20:44,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-09 06:20:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:44,173 INFO L225 Difference]: With dead ends: 122 [2020-12-09 06:20:44,173 INFO L226 Difference]: Without dead ends: 120 [2020-12-09 06:20:44,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:20:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-09 06:20:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-12-09 06:20:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-12-09 06:20:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2020-12-09 06:20:44,202 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 6 [2020-12-09 06:20:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:44,202 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2020-12-09 06:20:44,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:20:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2020-12-09 06:20:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:20:44,203 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:44,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:20:44,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 06:20:44,404 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:44,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1568476634, now seen corresponding path program 1 times [2020-12-09 06:20:44,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:44,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363161069] [2020-12-09 06:20:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:44,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:20:44,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:44,492 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 06:20:44,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:44,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363161069] [2020-12-09 06:20:44,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:44,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:20:44,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899028557] [2020-12-09 06:20:44,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:20:44,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:44,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:20:44,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:20:44,496 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 5 states. [2020-12-09 06:20:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:44,608 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-12-09 06:20:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:20:44,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 06:20:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:44,610 INFO L225 Difference]: With dead ends: 120 [2020-12-09 06:20:44,610 INFO L226 Difference]: Without dead ends: 120 [2020-12-09 06:20:44,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:20:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-09 06:20:44,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-12-09 06:20:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-12-09 06:20:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2020-12-09 06:20:44,618 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 9 [2020-12-09 06:20:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:44,618 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2020-12-09 06:20:44,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:20:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-12-09 06:20:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 06:20:44,619 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:44,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:20:44,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 06:20:44,820 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:44,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash 227387980, now seen corresponding path program 1 times [2020-12-09 06:20:44,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:44,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197851558] [2020-12-09 06:20:44,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:44,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:20:44,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:44,924 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 06:20:44,924 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:44,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:44,927 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:44,927 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:20:44,968 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:44,968 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 06:20:44,973 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:44,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:44,984 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 06:20:44,984 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:17 [2020-12-09 06:20:45,022 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 06:20:45,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:45,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197851558] [2020-12-09 06:20:45,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:45,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:20:45,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945194676] [2020-12-09 06:20:45,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:20:45,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:45,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:20:45,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:20:45,024 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 6 states. [2020-12-09 06:20:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:45,345 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2020-12-09 06:20:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 06:20:45,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-09 06:20:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:45,347 INFO L225 Difference]: With dead ends: 158 [2020-12-09 06:20:45,347 INFO L226 Difference]: Without dead ends: 158 [2020-12-09 06:20:45,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:20:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-09 06:20:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 131. [2020-12-09 06:20:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-12-09 06:20:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 150 transitions. [2020-12-09 06:20:45,357 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 150 transitions. Word has length 11 [2020-12-09 06:20:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:45,357 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 150 transitions. [2020-12-09 06:20:45,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:20:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2020-12-09 06:20:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 06:20:45,358 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:45,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:20:45,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 06:20:45,559 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:45,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:45,561 INFO L82 PathProgramCache]: Analyzing trace with hash 227387981, now seen corresponding path program 1 times [2020-12-09 06:20:45,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:45,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644164139] [2020-12-09 06:20:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:45,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 06:20:45,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:45,692 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 06:20:45,693 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:45,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:45,702 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 06:20:45,703 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:45,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:45,710 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:45,710 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:18 [2020-12-09 06:20:45,774 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:45,774 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 06:20:45,776 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:45,786 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:45,789 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 06:20:45,790 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:45,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:45,801 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 06:20:45,801 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2020-12-09 06:20:45,816 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 06:20:45,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:45,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644164139] [2020-12-09 06:20:45,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:45,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:20:45,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100293127] [2020-12-09 06:20:45,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:20:45,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:45,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:20:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:20:45,818 INFO L87 Difference]: Start difference. First operand 131 states and 150 transitions. Second operand 6 states. [2020-12-09 06:20:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:46,213 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2020-12-09 06:20:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:20:46,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-09 06:20:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:46,214 INFO L225 Difference]: With dead ends: 145 [2020-12-09 06:20:46,214 INFO L226 Difference]: Without dead ends: 145 [2020-12-09 06:20:46,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:20:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-12-09 06:20:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 126. [2020-12-09 06:20:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-09 06:20:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2020-12-09 06:20:46,222 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 11 [2020-12-09 06:20:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:46,222 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2020-12-09 06:20:46,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:20:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2020-12-09 06:20:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:20:46,223 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:46,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:20:46,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 06:20:46,425 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash -67083689, now seen corresponding path program 1 times [2020-12-09 06:20:46,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:46,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445323507] [2020-12-09 06:20:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:46,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:20:46,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:46,543 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 13 treesize of output 9 [2020-12-09 06:20:46,544 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:46,550 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:46,551 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 06:20:46,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2020-12-09 06:20:46,567 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 20 treesize of output 8 [2020-12-09 06:20:46,568 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:46,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:46,573 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 06:20:46,573 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2020-12-09 06:20:46,582 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 06:20:46,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:46,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445323507] [2020-12-09 06:20:46,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:46,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 06:20:46,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394472171] [2020-12-09 06:20:46,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:20:46,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:46,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:20:46,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:20:46,584 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 7 states. [2020-12-09 06:20:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:46,783 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2020-12-09 06:20:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 06:20:46,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 06:20:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:46,784 INFO L225 Difference]: With dead ends: 123 [2020-12-09 06:20:46,784 INFO L226 Difference]: Without dead ends: 123 [2020-12-09 06:20:46,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-12-09 06:20:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-09 06:20:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-12-09 06:20:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-12-09 06:20:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2020-12-09 06:20:46,789 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 16 [2020-12-09 06:20:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:46,789 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2020-12-09 06:20:46,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:20:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2020-12-09 06:20:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:20:46,790 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:46,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:20:46,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 06:20:46,991 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash -67086020, now seen corresponding path program 1 times [2020-12-09 06:20:46,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:46,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912088782] [2020-12-09 06:20:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:47,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:20:47,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:47,075 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 06:20:47,076 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:47,077 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:47,077 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:47,077 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:20:47,094 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 13 treesize of output 9 [2020-12-09 06:20:47,094 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:47,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:47,101 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 06:20:47,101 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-12-09 06:20:47,118 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 06:20:47,119 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:47,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:47,122 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 06:20:47,122 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2020-12-09 06:20:47,134 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 06:20:47,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:47,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912088782] [2020-12-09 06:20:47,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:47,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:20:47,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081120069] [2020-12-09 06:20:47,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:20:47,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:20:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:20:47,136 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand 7 states. [2020-12-09 06:20:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:47,593 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2020-12-09 06:20:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:20:47,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 06:20:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:47,594 INFO L225 Difference]: With dead ends: 146 [2020-12-09 06:20:47,594 INFO L226 Difference]: Without dead ends: 146 [2020-12-09 06:20:47,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:20:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-12-09 06:20:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2020-12-09 06:20:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-09 06:20:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2020-12-09 06:20:47,598 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 16 [2020-12-09 06:20:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:47,598 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2020-12-09 06:20:47,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:20:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2020-12-09 06:20:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:20:47,599 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:47,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:20:47,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 06:20:47,801 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:47,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:47,802 INFO L82 PathProgramCache]: Analyzing trace with hash -67086019, now seen corresponding path program 1 times [2020-12-09 06:20:47,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:47,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447998393] [2020-12-09 06:20:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:47,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 06:20:47,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:47,909 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 06:20:47,909 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:47,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:47,914 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:47,914 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:20:47,944 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 13 treesize of output 9 [2020-12-09 06:20:47,944 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:47,953 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:47,957 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 13 treesize of output 9 [2020-12-09 06:20:47,957 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:47,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:47,965 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 06:20:47,965 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-12-09 06:20:47,992 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 7 [2020-12-09 06:20:47,992 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:48,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:48,004 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 06:20:48,005 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:48,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:48,009 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 06:20:48,009 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2020-12-09 06:20:48,022 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 06:20:48,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:48,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447998393] [2020-12-09 06:20:48,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:48,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:20:48,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985031371] [2020-12-09 06:20:48,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:20:48,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:48,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:20:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:20:48,023 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand 7 states. [2020-12-09 06:20:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:48,504 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2020-12-09 06:20:48,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:20:48,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 06:20:48,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:48,506 INFO L225 Difference]: With dead ends: 171 [2020-12-09 06:20:48,506 INFO L226 Difference]: Without dead ends: 171 [2020-12-09 06:20:48,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:20:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-09 06:20:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 121. [2020-12-09 06:20:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-09 06:20:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2020-12-09 06:20:48,509 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 16 [2020-12-09 06:20:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:48,509 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2020-12-09 06:20:48,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:20:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2020-12-09 06:20:48,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 06:20:48,510 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:48,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:20:48,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 06:20:48,712 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash -45155363, now seen corresponding path program 1 times [2020-12-09 06:20:48,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:48,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371044691] [2020-12-09 06:20:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:48,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 06:20:48,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:48,865 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 06:20:48,865 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:48,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:48,867 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:48,867 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:20:48,895 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:48,895 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 06:20:48,897 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:48,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:48,904 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 06:20:48,904 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2020-12-09 06:20:48,959 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:48,959 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 06:20:48,961 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:48,990 INFO L625 ElimStorePlain]: treesize reduction 28, result has 41.7 percent of original size [2020-12-09 06:20:48,991 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 06:20:48,991 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2020-12-09 06:20:49,074 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 13 treesize of output 9 [2020-12-09 06:20:49,075 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:49,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:49,091 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 06:20:49,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2020-12-09 06:20:49,150 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 13 treesize of output 7 [2020-12-09 06:20:49,151 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 06:20:49,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:49,159 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 06:20:49,159 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:20 [2020-12-09 06:20:49,176 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 06:20:49,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:49,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371044691] [2020-12-09 06:20:49,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:49,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 06:20:49,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36452693] [2020-12-09 06:20:49,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 06:20:49,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 06:20:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:20:49,178 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 10 states. [2020-12-09 06:20:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:49,727 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2020-12-09 06:20:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 06:20:49,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-12-09 06:20:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:49,728 INFO L225 Difference]: With dead ends: 144 [2020-12-09 06:20:49,728 INFO L226 Difference]: Without dead ends: 144 [2020-12-09 06:20:49,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2020-12-09 06:20:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-09 06:20:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 120. [2020-12-09 06:20:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-12-09 06:20:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2020-12-09 06:20:49,731 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 18 [2020-12-09 06:20:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:49,731 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2020-12-09 06:20:49,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 06:20:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2020-12-09 06:20:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 06:20:49,732 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:49,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:20:49,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 06:20:49,933 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:49,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:49,933 INFO L82 PathProgramCache]: Analyzing trace with hash -45155362, now seen corresponding path program 1 times [2020-12-09 06:20:49,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:49,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127863590] [2020-12-09 06:20:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:50,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 06:20:50,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:50,025 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 06:20:50,026 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:50,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:50,034 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 06:20:50,035 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:50,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:50,040 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:50,040 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:18 [2020-12-09 06:20:50,079 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_49|], 3=[|v_#valid_72|]} [2020-12-09 06:20:50,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:20:50,084 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 06:20:50,085 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:50,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:50,118 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:50,118 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 06:20:50,120 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:50,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:50,135 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:20:50,135 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:25 [2020-12-09 06:20:50,172 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_50|], 3=[|v_#valid_73|]} [2020-12-09 06:20:50,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:20:50,177 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 14 treesize of output 16 [2020-12-09 06:20:50,178 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:50,197 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:50,215 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:50,215 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 06:20:50,216 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:50,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:50,237 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:50,237 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:9 [2020-12-09 06:20:50,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 06:20:50,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:50,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127863590] [2020-12-09 06:20:50,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:50,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:20:50,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953284476] [2020-12-09 06:20:50,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:20:50,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:20:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:20:50,258 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand 7 states. [2020-12-09 06:20:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:50,808 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2020-12-09 06:20:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:20:50,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-12-09 06:20:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:50,810 INFO L225 Difference]: With dead ends: 177 [2020-12-09 06:20:50,810 INFO L226 Difference]: Without dead ends: 177 [2020-12-09 06:20:50,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-09 06:20:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-12-09 06:20:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 118. [2020-12-09 06:20:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-12-09 06:20:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2020-12-09 06:20:50,814 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 18 [2020-12-09 06:20:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:50,814 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2020-12-09 06:20:50,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:20:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2020-12-09 06:20:50,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 06:20:50,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:50,815 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] [2020-12-09 06:20:51,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 06:20:51,016 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash -444630338, now seen corresponding path program 1 times [2020-12-09 06:20:51,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:51,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109101139] [2020-12-09 06:20:51,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:51,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:20:51,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:51,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 06:20:51,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:51,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109101139] [2020-12-09 06:20:51,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:51,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:20:51,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316476607] [2020-12-09 06:20:51,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:20:51,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:51,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:20:51,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:20:51,105 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 4 states. [2020-12-09 06:20:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:51,271 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2020-12-09 06:20:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:20:51,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-09 06:20:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:51,273 INFO L225 Difference]: With dead ends: 141 [2020-12-09 06:20:51,273 INFO L226 Difference]: Without dead ends: 141 [2020-12-09 06:20:51,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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 06:20:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-12-09 06:20:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2020-12-09 06:20:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-12-09 06:20:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2020-12-09 06:20:51,275 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 20 [2020-12-09 06:20:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:51,275 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2020-12-09 06:20:51,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:20:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2020-12-09 06:20:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 06:20:51,276 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:51,276 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] [2020-12-09 06:20:51,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 06:20:51,477 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash -444630337, now seen corresponding path program 1 times [2020-12-09 06:20:51,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:51,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140694082] [2020-12-09 06:20:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:51,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 06:20:51,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:51,676 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 06:20:51,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:51,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140694082] [2020-12-09 06:20:51,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:51,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:20:51,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631250892] [2020-12-09 06:20:51,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:20:51,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:51,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:20:51,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:20:51,677 INFO L87 Difference]: Start difference. First operand 117 states and 132 transitions. Second operand 7 states. [2020-12-09 06:20:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:51,911 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2020-12-09 06:20:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:20:51,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-12-09 06:20:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:51,912 INFO L225 Difference]: With dead ends: 116 [2020-12-09 06:20:51,912 INFO L226 Difference]: Without dead ends: 116 [2020-12-09 06:20:51,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:20:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-12-09 06:20:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-12-09 06:20:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-12-09 06:20:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2020-12-09 06:20:51,915 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 20 [2020-12-09 06:20:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:51,915 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2020-12-09 06:20:51,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:20:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2020-12-09 06:20:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 06:20:51,915 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:51,916 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 06:20:52,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-09 06:20:52,116 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:52,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:52,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2087991841, now seen corresponding path program 1 times [2020-12-09 06:20:52,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:52,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082140054] [2020-12-09 06:20:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:52,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 06:20:52,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:52,245 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 13 treesize of output 9 [2020-12-09 06:20:52,246 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:52,253 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:52,254 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 06:20:52,254 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2020-12-09 06:20:52,285 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 06:20:52,286 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:52,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:52,288 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 06:20:52,288 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2020-12-09 06:20:52,311 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 06:20:52,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:52,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082140054] [2020-12-09 06:20:52,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:52,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 06:20:52,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555782937] [2020-12-09 06:20:52,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 06:20:52,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 06:20:52,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-09 06:20:52,312 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 12 states. [2020-12-09 06:20:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:52,928 INFO L93 Difference]: Finished difference Result 174 states and 186 transitions. [2020-12-09 06:20:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 06:20:52,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-09 06:20:52,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:52,929 INFO L225 Difference]: With dead ends: 174 [2020-12-09 06:20:52,929 INFO L226 Difference]: Without dead ends: 174 [2020-12-09 06:20:52,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2020-12-09 06:20:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-09 06:20:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 115. [2020-12-09 06:20:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-12-09 06:20:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 130 transitions. [2020-12-09 06:20:52,932 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 130 transitions. Word has length 22 [2020-12-09 06:20:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:52,932 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 130 transitions. [2020-12-09 06:20:52,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 06:20:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2020-12-09 06:20:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 06:20:52,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:52,932 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 06:20:53,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-09 06:20:53,134 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2087991840, now seen corresponding path program 1 times [2020-12-09 06:20:53,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:53,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068152560] [2020-12-09 06:20:53,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:53,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 06:20:53,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:53,313 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 13 treesize of output 9 [2020-12-09 06:20:53,314 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:53,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:53,328 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 13 treesize of output 9 [2020-12-09 06:20:53,328 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:53,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:53,338 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 06:20:53,338 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:26 [2020-12-09 06:20:53,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 15 treesize of output 7 [2020-12-09 06:20:53,382 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:53,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:53,391 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 06:20:53,391 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:53,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:53,396 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 06:20:53,396 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2020-12-09 06:20:53,432 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 06:20:53,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:53,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068152560] [2020-12-09 06:20:53,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:53,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 06:20:53,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930088282] [2020-12-09 06:20:53,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 06:20:53,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 06:20:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:20:53,433 INFO L87 Difference]: Start difference. First operand 115 states and 130 transitions. Second operand 13 states. [2020-12-09 06:20:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:20:54,289 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2020-12-09 06:20:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 06:20:54,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-12-09 06:20:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:20:54,290 INFO L225 Difference]: With dead ends: 163 [2020-12-09 06:20:54,290 INFO L226 Difference]: Without dead ends: 163 [2020-12-09 06:20:54,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2020-12-09 06:20:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-09 06:20:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 114. [2020-12-09 06:20:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-09 06:20:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2020-12-09 06:20:54,293 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 22 [2020-12-09 06:20:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:20:54,293 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2020-12-09 06:20:54,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 06:20:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2020-12-09 06:20:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 06:20:54,294 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:20:54,294 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 06:20:54,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-09 06:20:54,495 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:20:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:20:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash -303237606, now seen corresponding path program 1 times [2020-12-09 06:20:54,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:20:54,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768840002] [2020-12-09 06:20:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:20:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:20:54,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 06:20:54,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:20:54,646 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 06:20:54,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:54,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:54,651 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:54,651 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:20:54,686 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:54,686 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 06:20:54,688 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:54,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:54,696 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:54,696 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2020-12-09 06:20:54,772 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:54,772 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 22 treesize of output 69 [2020-12-09 06:20:54,774 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:54,793 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:54,794 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:20:54,794 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:36 [2020-12-09 06:20:54,890 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:20:54,891 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:54,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:54,910 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 06:20:54,911 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:54 [2020-12-09 06:20:55,050 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:55,050 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 69 treesize of output 81 [2020-12-09 06:20:55,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:20:55,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:20:55,055 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:55,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:55,072 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 06:20:55,072 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:91, output treesize:54 [2020-12-09 06:20:55,080 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_26|], 2=[|v_#memory_$Pointer$.base_32|]} [2020-12-09 06:20:55,084 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:20:55,085 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:55,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:55,110 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 41 treesize of output 32 [2020-12-09 06:20:55,111 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:55,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:55,131 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 06:20:55,131 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:92 [2020-12-09 06:20:55,230 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 06:20:55,231 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:20:55,249 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:55,250 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 06:20:55,250 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:78 [2020-12-09 06:20:55,339 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:55,339 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 72 treesize of output 31 [2020-12-09 06:20:55,343 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 06:20:55,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:20:55,357 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 06:20:55,357 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:32 [2020-12-09 06:20:55,408 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 06:20:55,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:20:55,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768840002] [2020-12-09 06:20:55,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:20:55,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-12-09 06:20:55,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693465345] [2020-12-09 06:20:55,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 06:20:55,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:20:55,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 06:20:55,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-12-09 06:20:55,409 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 18 states. [2020-12-09 06:20:56,462 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-09 06:20:56,682 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-12-09 06:20:56,841 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-09 06:20:57,105 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2020-12-09 06:21:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:00,643 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2020-12-09 06:21:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 06:21:00,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2020-12-09 06:21:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:00,645 INFO L225 Difference]: With dead ends: 172 [2020-12-09 06:21:00,645 INFO L226 Difference]: Without dead ends: 172 [2020-12-09 06:21:00,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 06:21:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-09 06:21:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 113. [2020-12-09 06:21:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-09 06:21:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2020-12-09 06:21:00,648 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 23 [2020-12-09 06:21:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:00,648 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2020-12-09 06:21:00,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 06:21:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2020-12-09 06:21:00,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 06:21:00,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:00,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, 1] [2020-12-09 06:21:00,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-09 06:21:00,850 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:00,851 INFO L82 PathProgramCache]: Analyzing trace with hash -303237605, now seen corresponding path program 1 times [2020-12-09 06:21:00,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:00,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695758192] [2020-12-09 06:21:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:00,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 49 conjunts are in the unsatisfiable core [2020-12-09 06:21:00,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:00,975 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 06:21:00,975 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:00,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:00,979 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:00,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:21:01,013 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,014 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 06:21:01,015 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,023 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,023 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:21:01,077 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_51|], 3=[|v_#valid_79|]} [2020-12-09 06:21:01,080 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 06:21:01,081 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,110 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,110 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 18 treesize of output 28 [2020-12-09 06:21:01,111 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,125 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,126 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2020-12-09 06:21:01,221 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:21:01,221 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,245 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,250 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:21:01,251 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,271 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 06:21:01,271 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:51 [2020-12-09 06:21:01,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2020-12-09 06:21:01,386 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,417 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,449 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,449 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 71 treesize of output 83 [2020-12-09 06:21:01,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:21:01,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:21:01,452 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,470 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 06:21:01,470 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:53 [2020-12-09 06:21:01,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-12-09 06:21:01,510 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,534 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 41 treesize of output 32 [2020-12-09 06:21:01,535 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,558 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 06:21:01,558 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:89 [2020-12-09 06:21:01,785 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,785 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 36 [2020-12-09 06:21:01,786 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,803 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,805 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,805 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 63 treesize of output 26 [2020-12-09 06:21:01,806 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:01,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:01,813 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 06:21:01,813 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:11 [2020-12-09 06:21:01,850 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 06:21:01,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:01,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695758192] [2020-12-09 06:21:01,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:01,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-12-09 06:21:01,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377539029] [2020-12-09 06:21:01,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 06:21:01,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 06:21:01,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2020-12-09 06:21:01,851 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand 18 states. [2020-12-09 06:21:03,070 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-12-09 06:21:03,352 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-09 06:21:03,581 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-12-09 06:21:03,816 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 06:21:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:07,118 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2020-12-09 06:21:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 06:21:07,119 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2020-12-09 06:21:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:07,119 INFO L225 Difference]: With dead ends: 191 [2020-12-09 06:21:07,120 INFO L226 Difference]: Without dead ends: 191 [2020-12-09 06:21:07,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=291, Invalid=895, Unknown=4, NotChecked=0, Total=1190 [2020-12-09 06:21:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-09 06:21:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 112. [2020-12-09 06:21:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-09 06:21:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2020-12-09 06:21:07,122 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 23 [2020-12-09 06:21:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:07,122 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2020-12-09 06:21:07,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 06:21:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2020-12-09 06:21:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 06:21:07,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:07,123 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] [2020-12-09 06:21:07,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-09 06:21:07,324 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:07,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:07,325 INFO L82 PathProgramCache]: Analyzing trace with hash 646437723, now seen corresponding path program 1 times [2020-12-09 06:21:07,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:07,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357256650] [2020-12-09 06:21:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:07,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 06:21:07,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:07,453 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 06:21:07,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:07,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357256650] [2020-12-09 06:21:07,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:07,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:21:07,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963819532] [2020-12-09 06:21:07,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:21:07,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:07,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:21:07,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:21:07,454 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 5 states. [2020-12-09 06:21:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:07,683 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2020-12-09 06:21:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:21:07,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-09 06:21:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:07,684 INFO L225 Difference]: With dead ends: 170 [2020-12-09 06:21:07,684 INFO L226 Difference]: Without dead ends: 170 [2020-12-09 06:21:07,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:21:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-09 06:21:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 111. [2020-12-09 06:21:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-12-09 06:21:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2020-12-09 06:21:07,687 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 25 [2020-12-09 06:21:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:07,687 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2020-12-09 06:21:07,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:21:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2020-12-09 06:21:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 06:21:07,688 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:07,688 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] [2020-12-09 06:21:07,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-12-09 06:21:07,889 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:07,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:07,890 INFO L82 PathProgramCache]: Analyzing trace with hash 646437724, now seen corresponding path program 1 times [2020-12-09 06:21:07,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:07,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295849674] [2020-12-09 06:21:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:08,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 06:21:08,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:08,145 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 06:21:08,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:08,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295849674] [2020-12-09 06:21:08,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:08,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 06:21:08,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112888578] [2020-12-09 06:21:08,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 06:21:08,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:08,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 06:21:08,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:21:08,146 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 8 states. [2020-12-09 06:21:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:08,490 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2020-12-09 06:21:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 06:21:08,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-12-09 06:21:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:08,491 INFO L225 Difference]: With dead ends: 159 [2020-12-09 06:21:08,491 INFO L226 Difference]: Without dead ends: 159 [2020-12-09 06:21:08,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-09 06:21:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-09 06:21:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 110. [2020-12-09 06:21:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 06:21:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2020-12-09 06:21:08,494 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 25 [2020-12-09 06:21:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:08,494 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2020-12-09 06:21:08,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 06:21:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2020-12-09 06:21:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 06:21:08,495 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:08,495 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 06:21:08,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-12-09 06:21:08,696 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash -599451216, now seen corresponding path program 1 times [2020-12-09 06:21:08,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:08,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999957904] [2020-12-09 06:21:08,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:08,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 06:21:08,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:08,808 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 06:21:08,809 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:08,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:08,813 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:08,813 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:21:08,846 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 06:21:08,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:08,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999957904] [2020-12-09 06:21:08,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:08,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:21:08,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930553388] [2020-12-09 06:21:08,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:21:08,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:21:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:21:08,847 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 6 states. [2020-12-09 06:21:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:09,196 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2020-12-09 06:21:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:21:09,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-12-09 06:21:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:09,198 INFO L225 Difference]: With dead ends: 204 [2020-12-09 06:21:09,198 INFO L226 Difference]: Without dead ends: 204 [2020-12-09 06:21:09,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 06:21:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-09 06:21:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 106. [2020-12-09 06:21:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-09 06:21:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2020-12-09 06:21:09,200 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 28 [2020-12-09 06:21:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:09,200 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2020-12-09 06:21:09,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:21:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2020-12-09 06:21:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 06:21:09,200 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:09,200 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 06:21:09,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-12-09 06:21:09,402 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:09,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:09,404 INFO L82 PathProgramCache]: Analyzing trace with hash -599451217, now seen corresponding path program 1 times [2020-12-09 06:21:09,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:09,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979162629] [2020-12-09 06:21:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:09,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:21:09,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:09,532 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 06:21:09,533 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:09,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:09,534 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:09,534 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:21:09,551 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 06:21:09,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:09,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979162629] [2020-12-09 06:21:09,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:09,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:21:09,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263535596] [2020-12-09 06:21:09,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:21:09,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:09,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:21:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:21:09,552 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 6 states. [2020-12-09 06:21:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:09,886 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions. [2020-12-09 06:21:09,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:21:09,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-12-09 06:21:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:09,888 INFO L225 Difference]: With dead ends: 196 [2020-12-09 06:21:09,888 INFO L226 Difference]: Without dead ends: 196 [2020-12-09 06:21:09,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 06:21:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-12-09 06:21:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 102. [2020-12-09 06:21:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-12-09 06:21:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2020-12-09 06:21:09,891 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 28 [2020-12-09 06:21:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:09,891 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2020-12-09 06:21:09,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:21:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2020-12-09 06:21:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 06:21:09,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:09,892 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 06:21:10,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-12-09 06:21:10,093 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash -370567570, now seen corresponding path program 1 times [2020-12-09 06:21:10,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:10,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413808620] [2020-12-09 06:21:10,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:10,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:21:10,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:10,227 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 06:21:10,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:10,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413808620] [2020-12-09 06:21:10,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:10,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:21:10,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889069638] [2020-12-09 06:21:10,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:21:10,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:10,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:21:10,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:21:10,228 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 4 states. [2020-12-09 06:21:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:10,417 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2020-12-09 06:21:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:21:10,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-12-09 06:21:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:10,418 INFO L225 Difference]: With dead ends: 140 [2020-12-09 06:21:10,418 INFO L226 Difference]: Without dead ends: 140 [2020-12-09 06:21:10,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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 06:21:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-12-09 06:21:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 102. [2020-12-09 06:21:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-12-09 06:21:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2020-12-09 06:21:10,420 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 31 [2020-12-09 06:21:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:10,420 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2020-12-09 06:21:10,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:21:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2020-12-09 06:21:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 06:21:10,421 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:10,421 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 06:21:10,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 06:21:10,622 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash -370567569, now seen corresponding path program 1 times [2020-12-09 06:21:10,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:10,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849001310] [2020-12-09 06:21:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:10,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 06:21:10,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:10,814 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 06:21:10,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:10,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849001310] [2020-12-09 06:21:10,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:10,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:21:10,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422743449] [2020-12-09 06:21:10,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:21:10,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:21:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:21:10,815 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 7 states. [2020-12-09 06:21:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:11,091 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2020-12-09 06:21:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:21:11,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-12-09 06:21:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:11,092 INFO L225 Difference]: With dead ends: 122 [2020-12-09 06:21:11,092 INFO L226 Difference]: Without dead ends: 122 [2020-12-09 06:21:11,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:21:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-09 06:21:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2020-12-09 06:21:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-09 06:21:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2020-12-09 06:21:11,094 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 31 [2020-12-09 06:21:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:11,094 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2020-12-09 06:21:11,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:21:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2020-12-09 06:21:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 06:21:11,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:11,095 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 06:21:11,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 06:21:11,296 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1397340116, now seen corresponding path program 1 times [2020-12-09 06:21:11,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:11,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243464727] [2020-12-09 06:21:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:11,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 06:21:11,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:11,412 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 06:21:11,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:11,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243464727] [2020-12-09 06:21:11,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:11,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:21:11,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939097995] [2020-12-09 06:21:11,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:21:11,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:11,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:21:11,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:21:11,413 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 4 states. [2020-12-09 06:21:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:11,428 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2020-12-09 06:21:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:21:11,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-09 06:21:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:11,429 INFO L225 Difference]: With dead ends: 153 [2020-12-09 06:21:11,429 INFO L226 Difference]: Without dead ends: 153 [2020-12-09 06:21:11,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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 06:21:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-12-09 06:21:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 105. [2020-12-09 06:21:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-12-09 06:21:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2020-12-09 06:21:11,431 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 32 [2020-12-09 06:21:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:11,431 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2020-12-09 06:21:11,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:21:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2020-12-09 06:21:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 06:21:11,431 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:11,431 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 06:21:11,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-12-09 06:21:11,632 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 307690963, now seen corresponding path program 1 times [2020-12-09 06:21:11,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:11,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317842927] [2020-12-09 06:21:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:11,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 06:21:11,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:11,756 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 06:21:11,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:11,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317842927] [2020-12-09 06:21:11,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:11,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:21:11,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916711436] [2020-12-09 06:21:11,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:21:11,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:21:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:21:11,758 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 4 states. [2020-12-09 06:21:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:11,773 INFO L93 Difference]: Finished difference Result 199 states and 217 transitions. [2020-12-09 06:21:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:21:11,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-09 06:21:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:11,774 INFO L225 Difference]: With dead ends: 199 [2020-12-09 06:21:11,774 INFO L226 Difference]: Without dead ends: 199 [2020-12-09 06:21:11,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 06:21:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-09 06:21:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 107. [2020-12-09 06:21:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-12-09 06:21:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2020-12-09 06:21:11,776 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 33 [2020-12-09 06:21:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:11,776 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2020-12-09 06:21:11,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:21:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2020-12-09 06:21:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 06:21:11,777 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:11,777 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 06:21:11,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-12-09 06:21:11,978 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 366853935, now seen corresponding path program 1 times [2020-12-09 06:21:11,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:11,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613421017] [2020-12-09 06:21:11,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:12,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-09 06:21:12,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:12,181 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 13 treesize of output 9 [2020-12-09 06:21:12,182 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:12,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:12,188 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 06:21:12,188 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2020-12-09 06:21:12,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:12,253 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 26 [2020-12-09 06:21:12,254 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:12,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:12,262 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 06:21:12,262 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2020-12-09 06:21:12,283 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 06:21:12,284 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:12,285 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:12,286 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 06:21:12,286 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2020-12-09 06:21:12,311 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 06:21:12,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:12,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613421017] [2020-12-09 06:21:12,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:12,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 06:21:12,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732478077] [2020-12-09 06:21:12,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 06:21:12,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 06:21:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-12-09 06:21:12,312 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 14 states. [2020-12-09 06:21:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:13,310 INFO L93 Difference]: Finished difference Result 198 states and 209 transitions. [2020-12-09 06:21:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 06:21:13,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2020-12-09 06:21:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:13,311 INFO L225 Difference]: With dead ends: 198 [2020-12-09 06:21:13,311 INFO L226 Difference]: Without dead ends: 198 [2020-12-09 06:21:13,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=555, Unknown=0, NotChecked=0, Total=812 [2020-12-09 06:21:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-12-09 06:21:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 114. [2020-12-09 06:21:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-09 06:21:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2020-12-09 06:21:13,313 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 33 [2020-12-09 06:21:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:13,313 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2020-12-09 06:21:13,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 06:21:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2020-12-09 06:21:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 06:21:13,314 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:13,314 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 06:21:13,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-12-09 06:21:13,515 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash 366853936, now seen corresponding path program 1 times [2020-12-09 06:21:13,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:13,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19537267] [2020-12-09 06:21:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:13,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 49 conjunts are in the unsatisfiable core [2020-12-09 06:21:13,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:13,822 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 06:21:13,822 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:13,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:13,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 06:21:13,832 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:13,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:13,839 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:13,839 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2020-12-09 06:21:13,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:13,888 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 06:21:13,889 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:13,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:13,908 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:13,908 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 06:21:13,909 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:13,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:13,920 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 06:21:13,920 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2020-12-09 06:21:13,946 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 13 treesize of output 9 [2020-12-09 06:21:13,946 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:13,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:13,961 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 13 treesize of output 9 [2020-12-09 06:21:13,962 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:13,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:13,971 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 06:21:13,971 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2020-12-09 06:21:14,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:14,069 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 25 treesize of output 24 [2020-12-09 06:21:14,070 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:14,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:14,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:14,092 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 23 treesize of output 22 [2020-12-09 06:21:14,093 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:14,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:14,108 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 06:21:14,108 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2020-12-09 06:21:14,140 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 06:21:14,141 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:14,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:14,149 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 06:21:14,150 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:14,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:14,154 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 06:21:14,154 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:11 [2020-12-09 06:21:14,195 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 06:21:14,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:14,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19537267] [2020-12-09 06:21:14,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:14,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-09 06:21:14,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965215328] [2020-12-09 06:21:14,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 06:21:14,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:14,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 06:21:14,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-12-09 06:21:14,196 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 15 states. [2020-12-09 06:21:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:15,383 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2020-12-09 06:21:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 06:21:15,383 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2020-12-09 06:21:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:15,384 INFO L225 Difference]: With dead ends: 172 [2020-12-09 06:21:15,384 INFO L226 Difference]: Without dead ends: 172 [2020-12-09 06:21:15,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2020-12-09 06:21:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-09 06:21:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 119. [2020-12-09 06:21:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-09 06:21:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2020-12-09 06:21:15,387 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 33 [2020-12-09 06:21:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:15,387 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2020-12-09 06:21:15,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 06:21:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2020-12-09 06:21:15,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 06:21:15,387 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:15,387 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 06:21:15,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2020-12-09 06:21:15,588 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1184875165, now seen corresponding path program 1 times [2020-12-09 06:21:15,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:15,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945038734] [2020-12-09 06:21:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:15,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:21:15,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:15,729 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 06:21:15,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:15,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945038734] [2020-12-09 06:21:15,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:15,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:21:15,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450984914] [2020-12-09 06:21:15,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:21:15,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:15,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:21:15,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:21:15,730 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand 5 states. [2020-12-09 06:21:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:15,774 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2020-12-09 06:21:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:21:15,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-12-09 06:21:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:15,775 INFO L225 Difference]: With dead ends: 146 [2020-12-09 06:21:15,775 INFO L226 Difference]: Without dead ends: 146 [2020-12-09 06:21:15,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:21:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-12-09 06:21:15,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 109. [2020-12-09 06:21:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-12-09 06:21:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2020-12-09 06:21:15,777 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 34 [2020-12-09 06:21:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:15,777 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2020-12-09 06:21:15,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:21:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2020-12-09 06:21:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 06:21:15,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:15,778 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 06:21:15,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-12-09 06:21:15,978 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1512429801, now seen corresponding path program 1 times [2020-12-09 06:21:15,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:15,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071915430] [2020-12-09 06:21:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:16,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 66 conjunts are in the unsatisfiable core [2020-12-09 06:21:16,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:16,173 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 06:21:16,173 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,177 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,177 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:21:16,212 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,212 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 06:21:16,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,222 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,222 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:21:16,305 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,305 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 22 treesize of output 69 [2020-12-09 06:21:16,307 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,323 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,323 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:36 [2020-12-09 06:21:16,420 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:21:16,421 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,440 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,441 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 06:21:16,441 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:54 [2020-12-09 06:21:16,573 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,573 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 71 treesize of output 83 [2020-12-09 06:21:16,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:21:16,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:21:16,576 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,595 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 06:21:16,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:54 [2020-12-09 06:21:16,601 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_32|], 2=[|v_#memory_$Pointer$.base_42|]} [2020-12-09 06:21:16,606 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:21:16,606 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,631 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,634 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 41 treesize of output 32 [2020-12-09 06:21:16,635 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,657 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 06:21:16,657 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:92 [2020-12-09 06:21:16,911 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_33|], 6=[|v_#memory_$Pointer$.base_43|]} [2020-12-09 06:21:16,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:16,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-12-09 06:21:16,920 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:16,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:16,967 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 06:21:16,979 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:16,979 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 71 [2020-12-09 06:21:16,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:21:16,983 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:17,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:17,013 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 06:21:17,013 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:120, output treesize:94 [2020-12-09 06:21:17,105 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 06:21:17,106 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:17,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:17,124 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 06:21:17,124 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:78 [2020-12-09 06:21:17,229 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:17,229 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 72 treesize of output 31 [2020-12-09 06:21:17,231 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 06:21:17,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:17,244 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 06:21:17,244 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:32 [2020-12-09 06:21:17,303 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 06:21:17,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:17,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071915430] [2020-12-09 06:21:17,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:17,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-12-09 06:21:17,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488616416] [2020-12-09 06:21:17,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 06:21:17,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:17,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 06:21:17,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2020-12-09 06:21:17,304 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 21 states. [2020-12-09 06:21:19,432 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-09 06:21:19,736 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-09 06:21:19,983 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-09 06:21:20,370 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2020-12-09 06:21:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:25,247 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2020-12-09 06:21:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 06:21:25,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2020-12-09 06:21:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:25,249 INFO L225 Difference]: With dead ends: 153 [2020-12-09 06:21:25,249 INFO L226 Difference]: Without dead ends: 153 [2020-12-09 06:21:25,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=385, Invalid=1255, Unknown=0, NotChecked=0, Total=1640 [2020-12-09 06:21:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-12-09 06:21:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 110. [2020-12-09 06:21:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 06:21:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2020-12-09 06:21:25,251 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 34 [2020-12-09 06:21:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:25,251 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2020-12-09 06:21:25,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 06:21:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2020-12-09 06:21:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 06:21:25,251 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:25,251 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 06:21:25,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-12-09 06:21:25,452 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:25,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:25,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1512429800, now seen corresponding path program 1 times [2020-12-09 06:21:25,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:25,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728547448] [2020-12-09 06:21:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:25,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 74 conjunts are in the unsatisfiable core [2020-12-09 06:21:25,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:25,641 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 06:21:25,641 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:25,644 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:25,645 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:25,645 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:21:25,680 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:25,680 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 06:21:25,681 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:25,689 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:25,690 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:25,690 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:21:25,736 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_55|], 3=[|v_#valid_88|]} [2020-12-09 06:21:25,740 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 06:21:25,740 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:25,755 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:25,768 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:25,768 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 18 treesize of output 28 [2020-12-09 06:21:25,769 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:25,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:25,783 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:25,783 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2020-12-09 06:21:25,874 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:21:25,875 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:25,895 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:25,900 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:21:25,900 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:25,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:25,919 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 06:21:25,919 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:51 [2020-12-09 06:21:26,046 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,047 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 106 treesize of output 100 [2020-12-09 06:21:26,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 06:21:26,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 06:21:26,049 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:26,077 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2020-12-09 06:21:26,083 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:26,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,101 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 06:21:26,102 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:53 [2020-12-09 06:21:26,143 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-12-09 06:21:26,144 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:26,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,169 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 39 treesize of output 30 [2020-12-09 06:21:26,170 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:26,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,190 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 06:21:26,190 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:89 [2020-12-09 06:21:26,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:26,481 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2020-12-09 06:21:26,482 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:26,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:26,521 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 06:21:26,533 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,534 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 71 [2020-12-09 06:21:26,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:21:26,536 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:26,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,568 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 06:21:26,568 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:89 [2020-12-09 06:21:26,799 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,799 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 38 [2020-12-09 06:21:26,800 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:26,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,817 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,818 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 63 treesize of output 26 [2020-12-09 06:21:26,818 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:26,825 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:26,826 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 06:21:26,826 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:9 [2020-12-09 06:21:26,879 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 06:21:26,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:26,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728547448] [2020-12-09 06:21:26,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:26,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-12-09 06:21:26,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259677588] [2020-12-09 06:21:26,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 06:21:26,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:26,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 06:21:26,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2020-12-09 06:21:26,880 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 21 states. [2020-12-09 06:21:28,346 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 06:21:29,094 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-12-09 06:21:29,367 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-09 06:21:29,647 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-09 06:21:29,886 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-09 06:21:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:30,948 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2020-12-09 06:21:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 06:21:30,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2020-12-09 06:21:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:30,949 INFO L225 Difference]: With dead ends: 172 [2020-12-09 06:21:30,949 INFO L226 Difference]: Without dead ends: 172 [2020-12-09 06:21:30,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=359, Invalid=1279, Unknown=2, NotChecked=0, Total=1640 [2020-12-09 06:21:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-09 06:21:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 110. [2020-12-09 06:21:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 06:21:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2020-12-09 06:21:30,952 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 34 [2020-12-09 06:21:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:30,952 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2020-12-09 06:21:30,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 06:21:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2020-12-09 06:21:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 06:21:30,952 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:30,952 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 06:21:31,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-12-09 06:21:31,153 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:31,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1746089224, now seen corresponding path program 1 times [2020-12-09 06:21:31,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:31,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537524116] [2020-12-09 06:21:31,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:31,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 06:21:31,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:31,357 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 06:21:31,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:31,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537524116] [2020-12-09 06:21:31,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:31,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:21:31,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56916209] [2020-12-09 06:21:31,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:21:31,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:31,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:21:31,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:21:31,358 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2020-12-09 06:21:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:31,588 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2020-12-09 06:21:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:21:31,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-12-09 06:21:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:31,589 INFO L225 Difference]: With dead ends: 138 [2020-12-09 06:21:31,589 INFO L226 Difference]: Without dead ends: 138 [2020-12-09 06:21:31,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:21:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-12-09 06:21:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2020-12-09 06:21:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-12-09 06:21:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2020-12-09 06:21:31,591 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 36 [2020-12-09 06:21:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:31,591 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2020-12-09 06:21:31,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:21:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2020-12-09 06:21:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 06:21:31,592 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:31,592 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 06:21:31,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2020-12-09 06:21:31,793 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:31,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1746089223, now seen corresponding path program 1 times [2020-12-09 06:21:31,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:31,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163182693] [2020-12-09 06:21:31,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:31,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 06:21:31,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:31,989 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 06:21:31,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:31,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163182693] [2020-12-09 06:21:31,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:31,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 06:21:31,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764237635] [2020-12-09 06:21:31,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 06:21:31,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 06:21:31,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:21:31,990 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 8 states. [2020-12-09 06:21:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:32,327 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2020-12-09 06:21:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 06:21:32,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-12-09 06:21:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:32,328 INFO L225 Difference]: With dead ends: 148 [2020-12-09 06:21:32,328 INFO L226 Difference]: Without dead ends: 148 [2020-12-09 06:21:32,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-09 06:21:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-12-09 06:21:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 108. [2020-12-09 06:21:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-09 06:21:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2020-12-09 06:21:32,330 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 36 [2020-12-09 06:21:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:32,330 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2020-12-09 06:21:32,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 06:21:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2020-12-09 06:21:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 06:21:32,331 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:32,331 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] [2020-12-09 06:21:32,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2020-12-09 06:21:32,532 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1705807702, now seen corresponding path program 1 times [2020-12-09 06:21:32,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:32,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54154574] [2020-12-09 06:21:32,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:32,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 68 conjunts are in the unsatisfiable core [2020-12-09 06:21:32,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:32,836 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 06:21:32,837 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:32,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:32,841 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:32,841 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:21:32,874 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:32,875 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 06:21:32,876 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:32,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:32,887 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:32,887 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:21:32,947 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:32,947 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 06:21:32,948 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:32,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:32,961 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:32,962 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2020-12-09 06:21:33,044 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:21:33,044 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,067 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:21:33,067 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,083 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 06:21:33,084 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2020-12-09 06:21:33,128 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 30 treesize of output 12 [2020-12-09 06:21:33,129 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,141 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,141 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:28 [2020-12-09 06:21:33,182 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-12-09 06:21:33,182 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,196 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 06:21:33,196 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:20 [2020-12-09 06:21:33,228 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_49|], 2=[|v_#memory_$Pointer$.offset_40|]} [2020-12-09 06:21:33,232 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 13 treesize of output 9 [2020-12-09 06:21:33,232 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,249 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,252 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 25 treesize of output 24 [2020-12-09 06:21:33,253 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,268 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,268 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2020-12-09 06:21:33,530 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_50|], 6=[|v_#memory_$Pointer$.offset_41|]} [2020-12-09 06:21:33,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:33,535 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-09 06:21:33,536 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,565 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:33,569 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2020-12-09 06:21:33,570 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,596 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 06:21:33,596 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:40 [2020-12-09 06:21:33,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, 1 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 06:21:33,689 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,703 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 06:21:33,703 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:36 [2020-12-09 06:21:33,835 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 34 treesize of output 15 [2020-12-09 06:21:33,836 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:33,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:33,841 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 06:21:33,841 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2020-12-09 06:21:33,889 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 06:21:33,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:33,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54154574] [2020-12-09 06:21:33,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:33,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-09 06:21:33,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124138420] [2020-12-09 06:21:33,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 06:21:33,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:33,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 06:21:33,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=400, Unknown=4, NotChecked=0, Total=462 [2020-12-09 06:21:33,890 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 22 states. [2020-12-09 06:21:36,245 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-12-09 06:21:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:37,455 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2020-12-09 06:21:37,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-09 06:21:37,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2020-12-09 06:21:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:37,456 INFO L225 Difference]: With dead ends: 164 [2020-12-09 06:21:37,456 INFO L226 Difference]: Without dead ends: 164 [2020-12-09 06:21:37,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=480, Invalid=1678, Unknown=4, NotChecked=0, Total=2162 [2020-12-09 06:21:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-09 06:21:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 119. [2020-12-09 06:21:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-09 06:21:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2020-12-09 06:21:37,459 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 37 [2020-12-09 06:21:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:37,459 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2020-12-09 06:21:37,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 06:21:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2020-12-09 06:21:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 06:21:37,459 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:37,460 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] [2020-12-09 06:21:37,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2020-12-09 06:21:37,661 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1340431405, now seen corresponding path program 1 times [2020-12-09 06:21:37,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:37,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465921306] [2020-12-09 06:21:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:37,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 66 conjunts are in the unsatisfiable core [2020-12-09 06:21:37,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:37,925 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 06:21:37,926 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:37,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:37,930 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:37,930 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:21:37,963 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:37,963 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 06:21:37,964 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:37,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:37,973 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:37,973 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2020-12-09 06:21:38,032 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:38,032 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 16 treesize of output 26 [2020-12-09 06:21:38,033 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:38,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:38,047 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:38,047 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2020-12-09 06:21:38,152 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:21:38,153 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:38,171 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:38,172 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 06:21:38,172 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:40 [2020-12-09 06:21:38,313 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:38,313 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 67 treesize of output 79 [2020-12-09 06:21:38,314 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:21:38,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:21:38,315 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:38,332 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:38,333 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 06:21:38,333 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:40 [2020-12-09 06:21:38,337 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_42|], 2=[|v_#memory_$Pointer$.base_53|]} [2020-12-09 06:21:38,342 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-09 06:21:38,343 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:38,371 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:38,374 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 43 treesize of output 30 [2020-12-09 06:21:38,375 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:38,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:38,403 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:38,403 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2020-12-09 06:21:38,791 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_$Pointer$.base_54|]} [2020-12-09 06:21:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:38,801 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-12-09 06:21:38,802 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:38,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:38,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:38,849 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2020-12-09 06:21:38,850 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:38,893 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:38,894 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 06:21:38,894 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:60 [2020-12-09 06:21:39,022 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2020-12-09 06:21:39,022 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:39,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:39,047 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 06:21:39,047 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:56 [2020-12-09 06:21:39,295 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:39,295 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 59 treesize of output 22 [2020-12-09 06:21:39,296 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:39,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:39,302 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 06:21:39,302 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:3 [2020-12-09 06:21:39,362 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 06:21:39,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:39,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465921306] [2020-12-09 06:21:39,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:39,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-09 06:21:39,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940663883] [2020-12-09 06:21:39,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 06:21:39,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:39,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 06:21:39,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=400, Unknown=4, NotChecked=0, Total=462 [2020-12-09 06:21:39,363 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 22 states. [2020-12-09 06:21:42,989 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-12-09 06:21:43,332 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-09 06:21:43,811 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-12-09 06:21:44,009 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-12-09 06:21:44,448 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-12-09 06:21:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:46,087 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2020-12-09 06:21:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 06:21:46,088 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2020-12-09 06:21:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:46,089 INFO L225 Difference]: With dead ends: 162 [2020-12-09 06:21:46,089 INFO L226 Difference]: Without dead ends: 162 [2020-12-09 06:21:46,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=426, Invalid=1632, Unknown=12, NotChecked=0, Total=2070 [2020-12-09 06:21:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-12-09 06:21:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 120. [2020-12-09 06:21:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-12-09 06:21:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2020-12-09 06:21:46,091 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 38 [2020-12-09 06:21:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:46,091 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2020-12-09 06:21:46,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 06:21:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2020-12-09 06:21:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 06:21:46,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:46,092 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 06:21:46,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2020-12-09 06:21:46,293 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1296023217, now seen corresponding path program 1 times [2020-12-09 06:21:46,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:46,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292961193] [2020-12-09 06:21:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:46,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 06:21:46,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:46,554 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 06:21:46,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:46,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292961193] [2020-12-09 06:21:46,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:46,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:21:46,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449927289] [2020-12-09 06:21:46,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:21:46,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:46,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:21:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:21:46,556 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand 7 states. [2020-12-09 06:21:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:46,733 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2020-12-09 06:21:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:21:46,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-12-09 06:21:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:46,734 INFO L225 Difference]: With dead ends: 137 [2020-12-09 06:21:46,734 INFO L226 Difference]: Without dead ends: 137 [2020-12-09 06:21:46,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2020-12-09 06:21:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-12-09 06:21:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2020-12-09 06:21:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-09 06:21:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2020-12-09 06:21:46,736 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 39 [2020-12-09 06:21:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:46,736 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2020-12-09 06:21:46,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:21:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2020-12-09 06:21:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 06:21:46,737 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:46,737 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 06:21:46,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2020-12-09 06:21:46,938 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:46,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1396299208, now seen corresponding path program 1 times [2020-12-09 06:21:46,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:46,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130711236] [2020-12-09 06:21:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:47,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjunts are in the unsatisfiable core [2020-12-09 06:21:47,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:47,290 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 13 treesize of output 9 [2020-12-09 06:21:47,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:47,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:47,305 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 15 treesize of output 11 [2020-12-09 06:21:47,305 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:47,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:47,315 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:47,315 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2020-12-09 06:21:47,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:47,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-09 06:21:47,481 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:47,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:47,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:21:47,513 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 25 treesize of output 24 [2020-12-09 06:21:47,513 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:47,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:47,534 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 06:21:47,534 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:27 [2020-12-09 06:21:47,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 17 treesize of output 9 [2020-12-09 06:21:47,593 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:47,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:47,601 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 06:21:47,601 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-12-09 06:21:47,738 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:47,739 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 27 treesize of output 14 [2020-12-09 06:21:47,739 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:47,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:47,741 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 06:21:47,741 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2020-12-09 06:21:47,768 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 06:21:47,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:47,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130711236] [2020-12-09 06:21:47,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:47,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-12-09 06:21:47,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454972421] [2020-12-09 06:21:47,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 06:21:47,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:47,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 06:21:47,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-12-09 06:21:47,769 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 18 states. [2020-12-09 06:21:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:57,219 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2020-12-09 06:21:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 06:21:57,220 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2020-12-09 06:21:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:57,221 INFO L225 Difference]: With dead ends: 140 [2020-12-09 06:21:57,221 INFO L226 Difference]: Without dead ends: 140 [2020-12-09 06:21:57,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=854, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 06:21:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-12-09 06:21:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2020-12-09 06:21:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-09 06:21:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2020-12-09 06:21:57,224 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 39 [2020-12-09 06:21:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:57,224 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2020-12-09 06:21:57,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 06:21:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2020-12-09 06:21:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 06:21:57,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:57,224 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 06:21:57,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2020-12-09 06:21:57,425 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash -296506566, now seen corresponding path program 1 times [2020-12-09 06:21:57,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:57,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590679331] [2020-12-09 06:21:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:57,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 46 conjunts are in the unsatisfiable core [2020-12-09 06:21:57,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:57,608 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 13 treesize of output 9 [2020-12-09 06:21:57,608 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:57,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:57,614 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:57,614 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2020-12-09 06:21:57,661 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 06:21:57,662 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:57,663 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:57,663 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 06:21:57,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-09 06:21:57,707 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 06:21:57,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:57,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590679331] [2020-12-09 06:21:57,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:57,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 06:21:57,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243230863] [2020-12-09 06:21:57,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 06:21:57,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 06:21:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-12-09 06:21:57,708 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand 14 states. [2020-12-09 06:21:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:58,542 INFO L93 Difference]: Finished difference Result 171 states and 179 transitions. [2020-12-09 06:21:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 06:21:58,542 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-12-09 06:21:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:58,543 INFO L225 Difference]: With dead ends: 171 [2020-12-09 06:21:58,543 INFO L226 Difference]: Without dead ends: 171 [2020-12-09 06:21:58,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2020-12-09 06:21:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-09 06:21:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 122. [2020-12-09 06:21:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-09 06:21:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2020-12-09 06:21:58,545 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 40 [2020-12-09 06:21:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:58,546 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2020-12-09 06:21:58,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 06:21:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2020-12-09 06:21:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 06:21:58,546 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:58,546 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, 1] [2020-12-09 06:21:58,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2020-12-09 06:21:58,747 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1813736134, now seen corresponding path program 1 times [2020-12-09 06:21:58,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:58,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004576464] [2020-12-09 06:21:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:58,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 06:21:58,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:59,056 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 06:21:59,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:59,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004576464] [2020-12-09 06:21:59,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:59,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:21:59,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774591798] [2020-12-09 06:21:59,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:21:59,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:59,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:21:59,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:21:59,057 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 7 states. [2020-12-09 06:21:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:21:59,246 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2020-12-09 06:21:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:21:59,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-09 06:21:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:21:59,248 INFO L225 Difference]: With dead ends: 121 [2020-12-09 06:21:59,248 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 06:21:59,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:21:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 06:21:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-12-09 06:21:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-09 06:21:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2020-12-09 06:21:59,249 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 41 [2020-12-09 06:21:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:21:59,249 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2020-12-09 06:21:59,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:21:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2020-12-09 06:21:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 06:21:59,250 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:21:59,250 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, 1] [2020-12-09 06:21:59,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2020-12-09 06:21:59,451 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:21:59,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:21:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash -601768773, now seen corresponding path program 1 times [2020-12-09 06:21:59,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:21:59,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253605886] [2020-12-09 06:21:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:21:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:21:59,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2020-12-09 06:21:59,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:21:59,696 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 13 treesize of output 9 [2020-12-09 06:21:59,697 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:59,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:59,703 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:21:59,703 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-12-09 06:21:59,764 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 06:21:59,764 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:21:59,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:21:59,768 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 06:21:59,768 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2020-12-09 06:21:59,830 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 06:21:59,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:21:59,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253605886] [2020-12-09 06:21:59,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:21:59,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 06:21:59,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26527352] [2020-12-09 06:21:59,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 06:21:59,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:21:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 06:21:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-12-09 06:21:59,831 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 15 states. [2020-12-09 06:22:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:00,781 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2020-12-09 06:22:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 06:22:00,781 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-12-09 06:22:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:00,782 INFO L225 Difference]: With dead ends: 146 [2020-12-09 06:22:00,782 INFO L226 Difference]: Without dead ends: 146 [2020-12-09 06:22:00,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=524, Unknown=0, NotChecked=0, Total=756 [2020-12-09 06:22:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-12-09 06:22:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 121. [2020-12-09 06:22:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-09 06:22:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2020-12-09 06:22:00,784 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 41 [2020-12-09 06:22:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:00,784 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2020-12-09 06:22:00,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 06:22:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2020-12-09 06:22:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-09 06:22:00,784 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:00,784 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, 1, 1] [2020-12-09 06:22:00,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2020-12-09 06:22:00,985 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash -391245102, now seen corresponding path program 1 times [2020-12-09 06:22:00,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:00,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817183400] [2020-12-09 06:22:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/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 06:22:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:01,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 67 conjunts are in the unsatisfiable core [2020-12-09 06:22:01,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:01,208 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 06:22:01,208 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,212 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,212 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:22:01,245 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,246 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 06:22:01,247 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,256 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,256 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,256 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:22:01,342 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,343 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 24 treesize of output 71 [2020-12-09 06:22:01,344 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,363 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,363 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:36 [2020-12-09 06:22:01,469 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:22:01,469 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,490 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 06:22:01,490 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:54 [2020-12-09 06:22:01,631 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,631 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 71 treesize of output 83 [2020-12-09 06:22:01,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:22:01,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:22:01,633 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,651 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 06:22:01,651 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:54 [2020-12-09 06:22:01,656 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_47|], 2=[|v_#memory_$Pointer$.base_60|]} [2020-12-09 06:22:01,659 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-09 06:22:01,660 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,690 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 45 treesize of output 32 [2020-12-09 06:22:01,691 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:01,715 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:01,715 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:74 [2020-12-09 06:22:02,060 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_48|], 6=[|v_#memory_$Pointer$.base_61|]} [2020-12-09 06:22:02,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:02,068 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-12-09 06:22:02,069 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:02,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:02,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:02,123 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2020-12-09 06:22:02,125 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:02,162 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:02,163 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 06:22:02,163 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:74 [2020-12-09 06:22:02,290 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2020-12-09 06:22:02,291 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:02,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:02,322 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 06:22:02,322 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:70 [2020-12-09 06:22:02,502 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2020-12-09 06:22:02,503 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:02,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:02,516 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 06:22:02,516 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:32 [2020-12-09 06:22:02,698 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 26 treesize of output 29 [2020-12-09 06:22:02,700 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:02,721 INFO L625 ElimStorePlain]: treesize reduction 8, result has 73.3 percent of original size [2020-12-09 06:22:02,722 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 06:22:02,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2020-12-09 06:22:02,809 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 06:22:02,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:02,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817183400] [2020-12-09 06:22:02,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:02,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-09 06:22:02,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138475747] [2020-12-09 06:22:02,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 06:22:02,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 06:22:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=378, Unknown=10, NotChecked=0, Total=462 [2020-12-09 06:22:02,810 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand 22 states. [2020-12-09 06:22:23,005 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 06:22:25,254 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-12-09 06:22:25,507 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2020-12-09 06:22:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:26,294 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2020-12-09 06:22:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 06:22:26,294 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2020-12-09 06:22:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:26,295 INFO L225 Difference]: With dead ends: 144 [2020-12-09 06:22:26,295 INFO L226 Difference]: Without dead ends: 144 [2020-12-09 06:22:26,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=384, Invalid=1224, Unknown=32, NotChecked=0, Total=1640 [2020-12-09 06:22:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-09 06:22:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 124. [2020-12-09 06:22:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-09 06:22:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2020-12-09 06:22:26,297 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 42 [2020-12-09 06:22:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:26,297 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2020-12-09 06:22:26,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 06:22:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2020-12-09 06:22:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-09 06:22:26,297 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:26,297 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, 1, 1, 1] [2020-12-09 06:22:26,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3 [2020-12-09 06:22:26,499 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:26,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:26,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1520799971, now seen corresponding path program 1 times [2020-12-09 06:22:26,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:26,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273904805] [2020-12-09 06:22:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:26,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 60 conjunts are in the unsatisfiable core [2020-12-09 06:22:26,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:26,775 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 06:22:26,775 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:26,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:26,781 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 06:22:26,781 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:15 [2020-12-09 06:22:26,831 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 13 treesize of output 9 [2020-12-09 06:22:26,832 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:26,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:26,840 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:26,840 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2020-12-09 06:22:26,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:26,979 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 23 treesize of output 22 [2020-12-09 06:22:26,979 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:26,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:26,989 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:26,989 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2020-12-09 06:22:27,092 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:27,093 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2020-12-09 06:22:27,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:27,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:27,098 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 06:22:27,098 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:15 [2020-12-09 06:22:27,200 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 06:22:27,201 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:27,208 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-12-09 06:22:27,208 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:27,208 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:13 [2020-12-09 06:22:27,241 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 06:22:27,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:27,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273904805] [2020-12-09 06:22:27,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:27,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-09 06:22:27,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662332357] [2020-12-09 06:22:27,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 06:22:27,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 06:22:27,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2020-12-09 06:22:27,242 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 22 states. [2020-12-09 06:22:29,151 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2020-12-09 06:22:29,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:29,380 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2020-12-09 06:22:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 06:22:29,380 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2020-12-09 06:22:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:29,381 INFO L225 Difference]: With dead ends: 142 [2020-12-09 06:22:29,381 INFO L226 Difference]: Without dead ends: 142 [2020-12-09 06:22:29,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=487, Invalid=1235, Unknown=0, NotChecked=0, Total=1722 [2020-12-09 06:22:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-09 06:22:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2020-12-09 06:22:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-09 06:22:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2020-12-09 06:22:29,383 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 43 [2020-12-09 06:22:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:29,383 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2020-12-09 06:22:29,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 06:22:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2020-12-09 06:22:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-09 06:22:29,383 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:29,383 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, 1, 1, 1, 1] [2020-12-09 06:22:29,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 mathsat -unsat_core_generation=3 [2020-12-09 06:22:29,584 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:29,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1374922075, now seen corresponding path program 1 times [2020-12-09 06:22:29,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:29,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601639190] [2020-12-09 06:22:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 41 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:29,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 06:22:29,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:29,741 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 06:22:29,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:29,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601639190] [2020-12-09 06:22:29,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:29,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:22:29,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120273410] [2020-12-09 06:22:29,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:22:29,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:29,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:22:29,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:22:29,742 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 5 states. [2020-12-09 06:22:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:29,769 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2020-12-09 06:22:29,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:22:29,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-12-09 06:22:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:29,770 INFO L225 Difference]: With dead ends: 176 [2020-12-09 06:22:29,770 INFO L226 Difference]: Without dead ends: 176 [2020-12-09 06:22:29,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:22:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-12-09 06:22:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2020-12-09 06:22:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-09 06:22:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2020-12-09 06:22:29,772 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 44 [2020-12-09 06:22:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:29,772 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2020-12-09 06:22:29,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:22:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2020-12-09 06:22:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-09 06:22:29,772 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:29,772 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, 1, 1, 1, 1] [2020-12-09 06:22:29,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 mathsat -unsat_core_generation=3 [2020-12-09 06:22:29,973 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -673857497, now seen corresponding path program 1 times [2020-12-09 06:22:29,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:29,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966824917] [2020-12-09 06:22:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 42 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:30,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjunts are in the unsatisfiable core [2020-12-09 06:22:30,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:30,360 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 06:22:30,360 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:30,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:30,363 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 06:22:30,363 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:11 [2020-12-09 06:22:30,401 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 13 treesize of output 9 [2020-12-09 06:22:30,401 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:30,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:30,410 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 06:22:30,410 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2020-12-09 06:22:30,553 INFO L348 Elim1Store]: treesize reduction 14, result has 85.9 percent of original size [2020-12-09 06:22:30,553 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 103 [2020-12-09 06:22:30,555 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:30,568 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:30,569 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:30,569 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:41 [2020-12-09 06:22:30,766 INFO L348 Elim1Store]: treesize reduction 154, result has 0.6 percent of original size [2020-12-09 06:22:30,766 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 3 case distinctions, treesize of input 72 treesize of output 21 [2020-12-09 06:22:30,767 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:30,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:30,781 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:30,781 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:41 [2020-12-09 06:22:30,829 INFO L348 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2020-12-09 06:22:30,829 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 3 case distinctions, treesize of input 74 treesize of output 19 [2020-12-09 06:22:30,829 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:30,847 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:30,848 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:30,848 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:91, output treesize:39 [2020-12-09 06:22:30,861 INFO L348 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2020-12-09 06:22:30,861 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 3 case distinctions, treesize of input 74 treesize of output 19 [2020-12-09 06:22:30,861 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:30,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:30,877 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 06:22:30,877 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:39 [2020-12-09 06:22:31,014 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 27 treesize of output 15 [2020-12-09 06:22:31,015 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:31,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:31,027 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 06:22:31,027 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:24 [2020-12-09 06:22:31,114 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 06:22:31,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:31,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966824917] [2020-12-09 06:22:31,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:31,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-09 06:22:31,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959521792] [2020-12-09 06:22:31,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-09 06:22:31,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:31,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-09 06:22:31,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=309, Unknown=2, NotChecked=0, Total=380 [2020-12-09 06:22:31,115 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 20 states. [2020-12-09 06:22:32,633 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-12-09 06:22:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:33,047 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2020-12-09 06:22:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 06:22:33,048 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2020-12-09 06:22:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:33,048 INFO L225 Difference]: With dead ends: 152 [2020-12-09 06:22:33,048 INFO L226 Difference]: Without dead ends: 152 [2020-12-09 06:22:33,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=323, Invalid=933, Unknown=4, NotChecked=0, Total=1260 [2020-12-09 06:22:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-12-09 06:22:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2020-12-09 06:22:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-09 06:22:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2020-12-09 06:22:33,050 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 44 [2020-12-09 06:22:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:33,050 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2020-12-09 06:22:33,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-09 06:22:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2020-12-09 06:22:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-09 06:22:33,051 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:33,051 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, 1, 1, 1, 1] [2020-12-09 06:22:33,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3 [2020-12-09 06:22:33,252 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:33,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:33,253 INFO L82 PathProgramCache]: Analyzing trace with hash -673857496, now seen corresponding path program 1 times [2020-12-09 06:22:33,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:33,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773036622] [2020-12-09 06:22:33,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 43 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:33,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 58 conjunts are in the unsatisfiable core [2020-12-09 06:22:33,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:33,629 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 06:22:33,630 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:33,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,641 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 06:22:33,641 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:33,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,648 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:33,648 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:21 [2020-12-09 06:22:33,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:33,693 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 06:22:33,693 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:33,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,712 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,712 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 06:22:33,713 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:33,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,724 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 06:22:33,724 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2020-12-09 06:22:33,755 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 13 treesize of output 9 [2020-12-09 06:22:33,755 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:33,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,776 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 13 treesize of output 9 [2020-12-09 06:22:33,776 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:33,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,788 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 06:22:33,789 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:46 [2020-12-09 06:22:33,892 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_58|], 3=[|v_#valid_105|]} [2020-12-09 06:22:33,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:33,897 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 20 treesize of output 22 [2020-12-09 06:22:33,897 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:33,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,936 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 48 [2020-12-09 06:22:33,938 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:33,953 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:33,953 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 06:22:33,953 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:42 [2020-12-09 06:22:34,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,118 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 21 [2020-12-09 06:22:34,119 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:34,166 INFO L348 Elim1Store]: treesize reduction 154, result has 0.6 percent of original size [2020-12-09 06:22:34,166 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 13 [2020-12-09 06:22:34,167 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,178 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:34,179 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,179 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:42 [2020-12-09 06:22:34,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,203 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 15 [2020-12-09 06:22:34,204 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:34,256 INFO L348 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2020-12-09 06:22:34,257 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 3 case distinctions, treesize of input 76 treesize of output 21 [2020-12-09 06:22:34,257 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:34,272 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,272 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:146, output treesize:42 [2020-12-09 06:22:34,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:34,305 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2020-12-09 06:22:34,306 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:34,358 INFO L348 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2020-12-09 06:22:34,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 1 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 19 [2020-12-09 06:22:34,359 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:34,374 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 06:22:34,375 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:142, output treesize:28 [2020-12-09 06:22:34,456 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 06:22:34,457 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:34,464 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 06:22:34,465 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:34,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:34,469 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 06:22:34,469 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:11 [2020-12-09 06:22:34,525 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 06:22:34,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:34,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773036622] [2020-12-09 06:22:34,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:34,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-09 06:22:34,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95803887] [2020-12-09 06:22:34,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-09 06:22:34,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:34,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-09 06:22:34,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2020-12-09 06:22:34,526 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 20 states. [2020-12-09 06:22:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:36,354 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2020-12-09 06:22:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 06:22:36,354 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2020-12-09 06:22:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:36,355 INFO L225 Difference]: With dead ends: 158 [2020-12-09 06:22:36,355 INFO L226 Difference]: Without dead ends: 158 [2020-12-09 06:22:36,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 06:22:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-09 06:22:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 127. [2020-12-09 06:22:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-09 06:22:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2020-12-09 06:22:36,357 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 44 [2020-12-09 06:22:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:36,357 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2020-12-09 06:22:36,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-09 06:22:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2020-12-09 06:22:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-09 06:22:36,357 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:36,357 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, 1, 1, 1, 1] [2020-12-09 06:22:36,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 mathsat -unsat_core_generation=3 [2020-12-09 06:22:36,558 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1970585652, now seen corresponding path program 1 times [2020-12-09 06:22:36,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:36,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421889544] [2020-12-09 06:22:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 44 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:36,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:22:36,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:36,889 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 06:22:36,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:36,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421889544] [2020-12-09 06:22:36,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:36,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:22:36,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088943588] [2020-12-09 06:22:36,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:22:36,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:36,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:22:36,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:22:36,890 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 6 states. [2020-12-09 06:22:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:37,016 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2020-12-09 06:22:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:22:37,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-12-09 06:22:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:37,018 INFO L225 Difference]: With dead ends: 126 [2020-12-09 06:22:37,018 INFO L226 Difference]: Without dead ends: 126 [2020-12-09 06:22:37,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-09 06:22:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-12-09 06:22:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-12-09 06:22:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-09 06:22:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2020-12-09 06:22:37,019 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 44 [2020-12-09 06:22:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:37,019 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2020-12-09 06:22:37,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:22:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2020-12-09 06:22:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 06:22:37,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:37,020 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, 1, 1, 1, 1, 1] [2020-12-09 06:22:37,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 mathsat -unsat_core_generation=3 [2020-12-09 06:22:37,221 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:37,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1943743718, now seen corresponding path program 1 times [2020-12-09 06:22:37,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:37,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045232937] [2020-12-09 06:22:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 45 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:37,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 06:22:37,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:37,420 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 06:22:37,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:37,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045232937] [2020-12-09 06:22:37,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:37,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 06:22:37,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409186259] [2020-12-09 06:22:37,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:22:37,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:37,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:22:37,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:22:37,421 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 7 states. [2020-12-09 06:22:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:37,482 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2020-12-09 06:22:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:22:37,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-12-09 06:22:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:37,483 INFO L225 Difference]: With dead ends: 172 [2020-12-09 06:22:37,483 INFO L226 Difference]: Without dead ends: 172 [2020-12-09 06:22:37,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 06:22:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-09 06:22:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 131. [2020-12-09 06:22:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-12-09 06:22:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2020-12-09 06:22:37,485 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 45 [2020-12-09 06:22:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:37,485 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2020-12-09 06:22:37,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:22:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2020-12-09 06:22:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 06:22:37,485 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:37,485 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, 1, 1, 1, 1, 1] [2020-12-09 06:22:37,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 mathsat -unsat_core_generation=3 [2020-12-09 06:22:37,686 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1685578280, now seen corresponding path program 1 times [2020-12-09 06:22:37,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:37,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673208444] [2020-12-09 06:22:37,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 46 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:37,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:22:37,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:38,023 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 06:22:38,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:38,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673208444] [2020-12-09 06:22:38,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:38,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:22:38,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614327186] [2020-12-09 06:22:38,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:22:38,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:38,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:22:38,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:22:38,024 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 5 states. [2020-12-09 06:22:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:38,053 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2020-12-09 06:22:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:22:38,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-09 06:22:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:38,055 INFO L225 Difference]: With dead ends: 154 [2020-12-09 06:22:38,055 INFO L226 Difference]: Without dead ends: 154 [2020-12-09 06:22:38,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:22:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-09 06:22:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 124. [2020-12-09 06:22:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-09 06:22:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2020-12-09 06:22:38,057 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 45 [2020-12-09 06:22:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:38,057 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2020-12-09 06:22:38,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:22:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2020-12-09 06:22:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 06:22:38,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:38,057 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, 1, 1, 1, 1, 1] [2020-12-09 06:22:38,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 mathsat -unsat_core_generation=3 [2020-12-09 06:22:38,258 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash 585254175, now seen corresponding path program 1 times [2020-12-09 06:22:38,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:38,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044313661] [2020-12-09 06:22:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 47 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:38,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 70 conjunts are in the unsatisfiable core [2020-12-09 06:22:38,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:38,530 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 06:22:38,531 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:38,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:38,535 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:38,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:22:38,572 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:38,573 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 06:22:38,574 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:38,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:38,582 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:38,582 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:22:38,661 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:38,661 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 26 treesize of output 73 [2020-12-09 06:22:38,662 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:38,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:38,679 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:38,679 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:36 [2020-12-09 06:22:38,774 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:22:38,775 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:38,793 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:38,794 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 06:22:38,794 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:54 [2020-12-09 06:22:38,936 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:38,936 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 69 treesize of output 81 [2020-12-09 06:22:38,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:22:38,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:22:38,939 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:38,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:38,958 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 06:22:38,958 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:91, output treesize:54 [2020-12-09 06:22:38,965 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_53|], 2=[|v_#memory_$Pointer$.base_74|]} [2020-12-09 06:22:38,970 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:22:38,970 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:38,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:38,996 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 39 treesize of output 30 [2020-12-09 06:22:38,997 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:39,019 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:39,020 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 06:22:39,020 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:92 [2020-12-09 06:22:39,255 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:39,255 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 45 treesize of output 181 [2020-12-09 06:22:39,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:39,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:39,293 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:39,294 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:125 [2020-12-09 06:22:39,646 INFO L443 ElimStorePlain]: Different costs {8=[|v_#memory_$Pointer$.offset_54|], 18=[|v_#memory_$Pointer$.base_75|]} [2020-12-09 06:22:39,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,673 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 13 [2020-12-09 06:22:39,674 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:39,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:39,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,825 INFO L348 Elim1Store]: treesize reduction 301, result has 12.2 percent of original size [2020-12-09 06:22:39,826 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 87 [2020-12-09 06:22:39,827 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 06:22:39,829 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:39,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:39,876 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:39,876 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:219, output treesize:123 [2020-12-09 06:22:39,883 INFO L443 ElimStorePlain]: Different costs {8=[|v_#memory_$Pointer$.offset_55|], 18=[|v_#memory_$Pointer$.base_76|]} [2020-12-09 06:22:39,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:39,909 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2020-12-09 06:22:39,910 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:40,017 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-12-09 06:22:40,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:40,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:40,102 INFO L348 Elim1Store]: treesize reduction 323, result has 12.0 percent of original size [2020-12-09 06:22:40,103 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 89 [2020-12-09 06:22:40,104 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 06:22:40,106 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:40,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:40,140 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:40,140 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:227, output treesize:125 [2020-12-09 06:22:40,198 INFO L443 ElimStorePlain]: Different costs {8=[|v_#memory_$Pointer$.offset_56|], 18=[|v_#memory_$Pointer$.base_77|]} [2020-12-09 06:22:40,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:40,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:40,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:40,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:40,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:40,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:40,222 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 15 [2020-12-09 06:22:40,222 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:40,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:40,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:40,391 INFO L348 Elim1Store]: treesize reduction 323, result has 12.0 percent of original size [2020-12-09 06:22:40,391 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 91 [2020-12-09 06:22:40,392 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 06:22:40,394 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:40,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:40,428 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 06:22:40,429 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:231, output treesize:125 [2020-12-09 06:22:41,300 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 17 treesize of output 9 [2020-12-09 06:22:41,301 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:41,332 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:41,334 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 06:22:41,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:118, output treesize:109 [2020-12-09 06:22:41,489 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:41,489 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 41 [2020-12-09 06:22:41,491 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 06:22:41,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:41,518 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 06:22:41,518 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:108, output treesize:47 [2020-12-09 06:22:41,610 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 06:22:41,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:41,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044313661] [2020-12-09 06:22:41,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:41,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-12-09 06:22:41,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468493276] [2020-12-09 06:22:41,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 06:22:41,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:41,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 06:22:41,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=517, Unknown=1, NotChecked=0, Total=600 [2020-12-09 06:22:41,611 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 25 states. [2020-12-09 06:22:43,567 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-12-09 06:22:43,773 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-12-09 06:22:44,890 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2020-12-09 06:22:45,456 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2020-12-09 06:22:45,927 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-12-09 06:22:46,420 WARN L197 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2020-12-09 06:22:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:46,928 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-12-09 06:22:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 06:22:46,929 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2020-12-09 06:22:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:46,930 INFO L225 Difference]: With dead ends: 141 [2020-12-09 06:22:46,930 INFO L226 Difference]: Without dead ends: 141 [2020-12-09 06:22:46,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=473, Invalid=1777, Unknown=6, NotChecked=0, Total=2256 [2020-12-09 06:22:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-12-09 06:22:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 124. [2020-12-09 06:22:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-09 06:22:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2020-12-09 06:22:46,932 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 45 [2020-12-09 06:22:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:46,932 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2020-12-09 06:22:46,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 06:22:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2020-12-09 06:22:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 06:22:46,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:46,932 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, 1, 1, 1, 1, 1] [2020-12-09 06:22:47,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 mathsat -unsat_core_generation=3 [2020-12-09 06:22:47,133 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:47,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:47,134 INFO L82 PathProgramCache]: Analyzing trace with hash 585254176, now seen corresponding path program 1 times [2020-12-09 06:22:47,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:47,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668962652] [2020-12-09 06:22:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 48 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:47,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 79 conjunts are in the unsatisfiable core [2020-12-09 06:22:47,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:47,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 06:22:47,463 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:47,467 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,467 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:22:47,498 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:47,499 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 06:22:47,500 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:47,508 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,508 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2020-12-09 06:22:47,556 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_59|], 6=[|v_#valid_112|]} [2020-12-09 06:22:47,559 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 06:22:47,560 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,578 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:47,610 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:47,610 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 26 treesize of output 73 [2020-12-09 06:22:47,612 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:47,632 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,632 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:46 [2020-12-09 06:22:47,743 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:22:47,743 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:47,776 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:22:47,777 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,802 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:47,802 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 06:22:47,803 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:74 [2020-12-09 06:22:47,928 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2020-12-09 06:22:47,929 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:47,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:48,003 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:48,003 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 80 treesize of output 86 [2020-12-09 06:22:48,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 06:22:48,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 06:22:48,005 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:48,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:48,029 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 06:22:48,029 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:148, output treesize:76 [2020-12-09 06:22:48,071 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 52 treesize of output 39 [2020-12-09 06:22:48,073 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:48,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:48,109 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-12-09 06:22:48,109 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:48,137 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:48,138 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 06:22:48,138 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:120 [2020-12-09 06:22:48,364 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_60|], 6=[|v_#valid_113|]} [2020-12-09 06:22:48,396 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:48,396 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 1 case distinctions, treesize of input 22 treesize of output 68 [2020-12-09 06:22:48,398 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:48,481 INFO L625 ElimStorePlain]: treesize reduction 30, result has 83.0 percent of original size [2020-12-09 06:22:48,511 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:48,511 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2020-12-09 06:22:48,512 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:48,589 INFO L625 ElimStorePlain]: treesize reduction 14, result has 89.6 percent of original size [2020-12-09 06:22:48,590 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 06:22:48,590 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:133, output treesize:115 [2020-12-09 06:22:48,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:48,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:48,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:48,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:48,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:48,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:48,909 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 29 [2020-12-09 06:22:48,909 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:48,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:48,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,062 INFO L348 Elim1Store]: treesize reduction 301, result has 12.2 percent of original size [2020-12-09 06:22:49,062 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 89 [2020-12-09 06:22:49,063 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 06:22:49,065 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:49,099 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:49,100 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:49,100 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:211, output treesize:117 [2020-12-09 06:22:49,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,188 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 29 [2020-12-09 06:22:49,189 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:49,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:49,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,347 INFO L348 Elim1Store]: treesize reduction 323, result has 12.0 percent of original size [2020-12-09 06:22:49,347 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 91 [2020-12-09 06:22:49,349 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 06:22:49,350 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:49,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:49,381 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:49,381 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:219, output treesize:115 [2020-12-09 06:22:49,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,421 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 29 [2020-12-09 06:22:49,421 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:49,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:49,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:49,575 INFO L348 Elim1Store]: treesize reduction 323, result has 12.0 percent of original size [2020-12-09 06:22:49,575 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 89 [2020-12-09 06:22:49,577 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 06:22:49,578 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:49,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:49,608 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 06:22:49,608 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:217, output treesize:89 [2020-12-09 06:22:49,911 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:49,911 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 38 [2020-12-09 06:22:49,912 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:49,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:49,928 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:49,928 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 63 treesize of output 26 [2020-12-09 06:22:49,929 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:49,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:49,936 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 06:22:49,936 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:9 [2020-12-09 06:22:50,006 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 06:22:50,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:50,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668962652] [2020-12-09 06:22:50,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:50,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-12-09 06:22:50,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55731668] [2020-12-09 06:22:50,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 06:22:50,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 06:22:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2020-12-09 06:22:50,007 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 25 states. [2020-12-09 06:22:51,547 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 06:22:52,211 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-12-09 06:22:52,401 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 06:22:53,579 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-09 06:22:53,810 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-09 06:22:54,020 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-09 06:22:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:22:54,658 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2020-12-09 06:22:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 06:22:54,659 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2020-12-09 06:22:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:22:54,660 INFO L225 Difference]: With dead ends: 158 [2020-12-09 06:22:54,660 INFO L226 Difference]: Without dead ends: 158 [2020-12-09 06:22:54,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=414, Invalid=1842, Unknown=0, NotChecked=0, Total=2256 [2020-12-09 06:22:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-09 06:22:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 124. [2020-12-09 06:22:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-09 06:22:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2020-12-09 06:22:54,662 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 45 [2020-12-09 06:22:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:22:54,662 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2020-12-09 06:22:54,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 06:22:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2020-12-09 06:22:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 06:22:54,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:22:54,663 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, 1, 1, 1, 1, 1] [2020-12-09 06:22:54,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 mathsat -unsat_core_generation=3 [2020-12-09 06:22:54,864 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:22:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:22:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash 958613279, now seen corresponding path program 1 times [2020-12-09 06:22:54,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:22:54,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117796048] [2020-12-09 06:22:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 49 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with mathsat -unsat_core_generation=3 [2020-12-09 06:22:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:22:55,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 71 conjunts are in the unsatisfiable core [2020-12-09 06:22:55,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:22:55,135 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 06:22:55,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,139 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,139 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:22:55,171 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,171 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 06:22:55,172 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,181 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,181 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2020-12-09 06:22:55,230 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_61|], 6=[|v_#valid_116|]} [2020-12-09 06:22:55,234 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 06:22:55,234 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,249 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,279 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,279 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 22 treesize of output 69 [2020-12-09 06:22:55,280 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,298 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,299 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,299 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:43 [2020-12-09 06:22:55,412 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:22:55,412 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,436 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,436 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 06:22:55,437 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:65 [2020-12-09 06:22:55,583 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,583 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 84 treesize of output 90 [2020-12-09 06:22:55,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 06:22:55,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 06:22:55,585 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,607 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 06:22:55,607 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:67 [2020-12-09 06:22:55,651 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2020-12-09 06:22:55,653 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,712 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_63|], 2=[|v_#memory_$Pointer$.base_86|]} [2020-12-09 06:22:55,720 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-09 06:22:55,721 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,760 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 45 treesize of output 32 [2020-12-09 06:22:55,761 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:55,792 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:55,792 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:100, output treesize:74 [2020-12-09 06:22:56,204 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_64|], 6=[|v_#memory_$Pointer$.base_87|]} [2020-12-09 06:22:56,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:56,213 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-12-09 06:22:56,214 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:56,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:56,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:22:56,279 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2020-12-09 06:22:56,281 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:56,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:56,328 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 06:22:56,328 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:74 [2020-12-09 06:22:56,448 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2020-12-09 06:22:56,449 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:56,474 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:56,474 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:56,475 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:83, output treesize:70 [2020-12-09 06:22:56,622 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2020-12-09 06:22:56,623 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:56,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:56,636 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:22:56,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:30 [2020-12-09 06:22:56,691 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 26 treesize of output 29 [2020-12-09 06:22:56,693 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:56,709 INFO L625 ElimStorePlain]: treesize reduction 8, result has 73.3 percent of original size [2020-12-09 06:22:56,710 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 06:22:56,710 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2020-12-09 06:22:56,873 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:22:56,873 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 3 case distinctions, treesize of input 26 treesize of output 59 [2020-12-09 06:22:56,874 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:22:56,891 INFO L625 ElimStorePlain]: treesize reduction 8, result has 71.4 percent of original size [2020-12-09 06:22:56,892 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 06:22:56,892 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2020-12-09 06:22:56,968 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 06:22:56,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:22:56,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117796048] [2020-12-09 06:22:56,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:22:56,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-12-09 06:22:56,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237470749] [2020-12-09 06:22:56,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 06:22:56,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:22:56,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 06:22:56,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2020-12-09 06:22:56,969 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 23 states. [2020-12-09 06:23:16,314 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-12-09 06:23:20,933 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2020-12-09 06:23:33,376 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-12-09 06:23:33,601 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-12-09 06:23:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:23:40,638 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2020-12-09 06:23:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 06:23:40,639 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2020-12-09 06:23:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:23:40,639 INFO L225 Difference]: With dead ends: 143 [2020-12-09 06:23:40,639 INFO L226 Difference]: Without dead ends: 143 [2020-12-09 06:23:40,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=410, Invalid=1570, Unknown=0, NotChecked=0, Total=1980 [2020-12-09 06:23:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-09 06:23:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2020-12-09 06:23:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-09 06:23:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2020-12-09 06:23:40,642 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 45 [2020-12-09 06:23:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:23:40,642 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2020-12-09 06:23:40,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 06:23:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2020-12-09 06:23:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 06:23:40,643 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:23:40,643 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, 1, 1, 1, 1, 1, 1] [2020-12-09 06:23:40,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 mathsat -unsat_core_generation=3 [2020-12-09 06:23:40,844 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:23:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:23:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash -128422557, now seen corresponding path program 1 times [2020-12-09 06:23:40,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:23:40,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053906853] [2020-12-09 06:23:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 50 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with mathsat -unsat_core_generation=3 [2020-12-09 06:23:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:23:41,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 06:23:41,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:23:41,066 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 06:23:41,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:23:41,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053906853] [2020-12-09 06:23:41,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:23:41,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 06:23:41,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800638389] [2020-12-09 06:23:41,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 06:23:41,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:23:41,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 06:23:41,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-09 06:23:41,067 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 9 states. [2020-12-09 06:23:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:23:41,178 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2020-12-09 06:23:41,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:23:41,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2020-12-09 06:23:41,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:23:41,179 INFO L225 Difference]: With dead ends: 135 [2020-12-09 06:23:41,179 INFO L226 Difference]: Without dead ends: 135 [2020-12-09 06:23:41,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-12-09 06:23:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-12-09 06:23:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2020-12-09 06:23:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-12-09 06:23:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2020-12-09 06:23:41,181 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 46 [2020-12-09 06:23:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:23:41,181 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2020-12-09 06:23:41,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 06:23:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2020-12-09 06:23:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 06:23:41,182 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:23:41,182 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, 1, 1, 1, 1, 1, 1] [2020-12-09 06:23:41,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 mathsat -unsat_core_generation=3 [2020-12-09 06:23:41,383 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:23:41,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:23:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash -128421500, now seen corresponding path program 1 times [2020-12-09 06:23:41,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:23:41,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010414309] [2020-12-09 06:23:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 51 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with mathsat -unsat_core_generation=3 [2020-12-09 06:23:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:23:41,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-09 06:23:41,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:23:41,626 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 06:23:41,626 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:23:41,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:23:41,630 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 06:23:41,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:11 [2020-12-09 06:23:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:23:41,671 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:23:41,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:23:41,678 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:23:41,678 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-12-09 06:23:41,716 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 06:23:41,717 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:23:41,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:23:41,721 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 06:23:41,721 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2020-12-09 06:23:41,759 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:23:41,759 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 06:23:41,760 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:23:41,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:23:41,765 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:23:41,765 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:17 [2020-12-09 06:23:41,834 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 0 case distinctions, treesize of input 19 treesize of output 19 [2020-12-09 06:23:41,835 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:23:41,843 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-12-09 06:23:41,843 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 06:23:41,843 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2020-12-09 06:23:41,877 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 06:23:41,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:23:41,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010414309] [2020-12-09 06:23:41,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:23:41,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-09 06:23:41,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582109959] [2020-12-09 06:23:41,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 06:23:41,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:23:41,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 06:23:41,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-12-09 06:23:41,878 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 17 states. [2020-12-09 06:23:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:23:59,002 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2020-12-09 06:23:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 06:23:59,003 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2020-12-09 06:23:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:23:59,003 INFO L225 Difference]: With dead ends: 133 [2020-12-09 06:23:59,003 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 06:23:59,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2020-12-09 06:23:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 06:23:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2020-12-09 06:23:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-12-09 06:23:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2020-12-09 06:23:59,005 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 46 [2020-12-09 06:23:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:23:59,005 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2020-12-09 06:23:59,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 06:23:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2020-12-09 06:23:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 06:23:59,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:23:59,006 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, 1, 1, 1, 1, 1, 1] [2020-12-09 06:23:59,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 mathsat -unsat_core_generation=3 [2020-12-09 06:23:59,207 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:23:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:23:59,208 INFO L82 PathProgramCache]: Analyzing trace with hash -347759207, now seen corresponding path program 1 times [2020-12-09 06:23:59,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:23:59,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378146536] [2020-12-09 06:23:59,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 52 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with mathsat -unsat_core_generation=3 [2020-12-09 06:23:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:23:59,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 75 conjunts are in the unsatisfiable core [2020-12-09 06:23:59,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:23:59,489 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:23:59,489 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 06:23:59,489 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:23:59,500 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 06:23:59,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:23:59,501 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 06:23:59,501 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 06:23:59,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:23:59,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:23:59,684 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 06:23:59,685 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:23:59,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:23:59,709 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 06:23:59,709 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:57 [2020-12-09 06:23:59,912 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 13 treesize of output 9 [2020-12-09 06:23:59,913 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:23:59,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:23:59,945 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 06:23:59,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:71 [2020-12-09 06:24:00,167 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:00,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 84 treesize of output 96 [2020-12-09 06:24:00,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:24:00,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:24:00,170 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:00,234 INFO L625 ElimStorePlain]: treesize reduction 38, result has 65.1 percent of original size [2020-12-09 06:24:00,234 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 06:24:00,235 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:108, output treesize:75 [2020-12-09 06:24:00,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:00,318 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2020-12-09 06:24:00,321 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:00,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:00,379 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_65|], 2=[|v_#memory_$Pointer$.base_91|]} [2020-12-09 06:24:00,385 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 15 treesize of output 11 [2020-12-09 06:24:00,386 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:00,421 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:00,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:00,425 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 49 treesize of output 42 [2020-12-09 06:24:00,426 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:00,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:00,460 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:24:00,460 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:108, output treesize:82 [2020-12-09 06:24:01,184 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_66|], 6=[|v_#memory_$Pointer$.base_92|]} [2020-12-09 06:24:01,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:01,193 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 25 treesize of output 24 [2020-12-09 06:24:01,194 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:01,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:01,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:01,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:01,257 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2020-12-09 06:24:01,260 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:01,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:01,309 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:24:01,309 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:108, output treesize:80 [2020-12-09 06:24:01,788 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 06:24:01,790 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:01,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:01,830 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 06:24:01,830 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:76 [2020-12-09 06:24:02,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:02,092 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2020-12-09 06:24:02,094 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:02,119 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:02,120 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 06:24:02,120 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:44 [2020-12-09 06:24:15,487 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 06:24:15,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:24:15,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378146536] [2020-12-09 06:24:15,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:24:15,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-12-09 06:24:15,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104309493] [2020-12-09 06:24:15,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 06:24:15,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:24:15,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 06:24:15,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=520, Unknown=2, NotChecked=0, Total=600 [2020-12-09 06:24:15,488 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 25 states. [2020-12-09 06:24:24,629 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-09 06:24:24,964 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2020-12-09 06:24:25,336 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2020-12-09 06:24:25,604 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2020-12-09 06:24:26,065 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2020-12-09 06:24:26,730 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2020-12-09 06:24:27,180 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-12-09 06:24:27,691 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2020-12-09 06:24:28,728 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-12-09 06:24:29,765 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2020-12-09 06:24:30,271 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-12-09 06:24:31,254 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2020-12-09 06:24:35,629 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-12-09 06:24:39,995 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-12-09 06:24:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:24:40,562 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2020-12-09 06:24:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-09 06:24:40,562 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2020-12-09 06:24:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:24:40,563 INFO L225 Difference]: With dead ends: 119 [2020-12-09 06:24:40,563 INFO L226 Difference]: Without dead ends: 108 [2020-12-09 06:24:40,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 14 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=252, Invalid=1548, Unknown=6, NotChecked=0, Total=1806 [2020-12-09 06:24:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-12-09 06:24:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2020-12-09 06:24:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-12-09 06:24:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2020-12-09 06:24:40,565 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 46 [2020-12-09 06:24:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:24:40,565 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2020-12-09 06:24:40,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 06:24:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2020-12-09 06:24:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 06:24:40,566 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:24:40,566 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, 1, 1, 1, 1, 1, 1] [2020-12-09 06:24:40,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 mathsat -unsat_core_generation=3 [2020-12-09 06:24:40,767 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:24:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:24:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1457937310, now seen corresponding path program 1 times [2020-12-09 06:24:40,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:24:40,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105053330] [2020-12-09 06:24:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 53 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with mathsat -unsat_core_generation=3 [2020-12-09 06:24:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:24:41,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 73 conjunts are in the unsatisfiable core [2020-12-09 06:24:41,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:24:41,034 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-12-09 06:24:41,034 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:41,042 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-12-09 06:24:41,043 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 06:24:41,043 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-12-09 06:24:41,065 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:41,065 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 06:24:41,066 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:41,086 INFO L625 ElimStorePlain]: treesize reduction 22, result has 46.3 percent of original size [2020-12-09 06:24:41,087 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 06:24:41,087 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:21 [2020-12-09 06:24:41,142 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:41,142 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 17 treesize of output 44 [2020-12-09 06:24:41,143 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:41,166 INFO L625 ElimStorePlain]: treesize reduction 22, result has 50.0 percent of original size [2020-12-09 06:24:41,167 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 06:24:41,167 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:24 [2020-12-09 06:24:41,236 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:41,237 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 17 treesize of output 44 [2020-12-09 06:24:41,238 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:41,260 INFO L625 ElimStorePlain]: treesize reduction 22, result has 50.0 percent of original size [2020-12-09 06:24:41,261 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 06:24:41,261 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:24 [2020-12-09 06:24:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-09 06:24:41,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:41,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:41,308 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 13 treesize of output 9 [2020-12-09 06:24:41,309 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:41,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:41,323 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:24:41,323 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2020-12-09 06:24:41,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:41,570 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 23 treesize of output 22 [2020-12-09 06:24:41,570 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:41,599 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:41,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:41,603 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 25 treesize of output 24 [2020-12-09 06:24:41,604 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:41,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:41,628 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 06:24:41,628 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:46 [2020-12-09 06:24:41,887 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 06:24:41,887 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2020-12-09 06:24:41,888 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:41,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:41,909 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 06:24:41,910 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2020-12-09 06:24:42,654 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:42,654 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 31 treesize of output 105 [2020-12-09 06:24:42,656 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:42,683 INFO L625 ElimStorePlain]: treesize reduction 18, result has 70.0 percent of original size [2020-12-09 06:24:42,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 06:24:42,684 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:42 [2020-12-09 06:24:42,773 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:42,773 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 28 [2020-12-09 06:24:42,775 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:42,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:42,779 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 06:24:42,780 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:13 [2020-12-09 06:24:42,853 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 06:24:42,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:24:42,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105053330] [2020-12-09 06:24:42,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:24:42,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-12-09 06:24:42,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164620508] [2020-12-09 06:24:42,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-09 06:24:42,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:24:42,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-09 06:24:42,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2020-12-09 06:24:42,854 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 26 states. [2020-12-09 06:24:46,737 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-12-09 06:24:46,948 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-12-09 06:24:47,246 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-12-09 06:24:47,482 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-12-09 06:24:47,719 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2020-12-09 06:24:47,985 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2020-12-09 06:24:48,278 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-12-09 06:24:48,563 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-12-09 06:24:48,898 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-12-09 06:24:49,273 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2020-12-09 06:24:49,765 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-12-09 06:24:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:24:49,986 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2020-12-09 06:24:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 06:24:49,986 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2020-12-09 06:24:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:24:49,987 INFO L225 Difference]: With dead ends: 115 [2020-12-09 06:24:49,987 INFO L226 Difference]: Without dead ends: 115 [2020-12-09 06:24:49,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=557, Invalid=1605, Unknown=0, NotChecked=0, Total=2162 [2020-12-09 06:24:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-09 06:24:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2020-12-09 06:24:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-09 06:24:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2020-12-09 06:24:49,988 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 46 [2020-12-09 06:24:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:24:49,989 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2020-12-09 06:24:49,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-09 06:24:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2020-12-09 06:24:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 06:24:49,989 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:24:49,989 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:24:50,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 mathsat -unsat_core_generation=3 [2020-12-09 06:24:50,190 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:24:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:24:50,191 INFO L82 PathProgramCache]: Analyzing trace with hash 313900927, now seen corresponding path program 1 times [2020-12-09 06:24:50,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:24:50,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013062250] [2020-12-09 06:24:50,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 54 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with mathsat -unsat_core_generation=3 [2020-12-09 06:24:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:24:50,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 50 conjunts are in the unsatisfiable core [2020-12-09 06:24:50,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:24:50,435 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 06:24:50,435 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,439 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,439 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:24:50,475 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,475 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 06:24:50,476 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,487 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,487 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:24:50,549 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,549 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 18 treesize of output 28 [2020-12-09 06:24:50,549 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,566 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:22 [2020-12-09 06:24:50,650 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:24:50,651 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,669 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,674 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:24:50,674 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,691 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 06:24:50,691 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2020-12-09 06:24:50,789 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 30 treesize of output 12 [2020-12-09 06:24:50,790 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,805 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,806 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,806 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:33 [2020-12-09 06:24:50,856 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-12-09 06:24:50,857 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,873 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,874 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 06:24:50,874 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:25 [2020-12-09 06:24:50,911 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_96|], 2=[|v_#memory_$Pointer$.offset_71|]} [2020-12-09 06:24:50,915 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 13 treesize of output 9 [2020-12-09 06:24:50,915 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,937 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 25 treesize of output 24 [2020-12-09 06:24:50,938 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:50,955 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:24:50,955 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2020-12-09 06:24:51,079 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 15 treesize of output 7 [2020-12-09 06:24:51,080 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:51,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:51,103 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 06:24:51,104 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:34 [2020-12-09 06:24:51,258 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:51,258 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 06:24:51,259 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:51,273 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:51,273 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 06:24:51,274 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:30 [2020-12-09 06:24:51,633 INFO L348 Elim1Store]: treesize reduction 301, result has 12.2 percent of original size [2020-12-09 06:24:51,633 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 60 [2020-12-09 06:24:51,635 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:51,673 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:51,674 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:51,674 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 06:24:51,674 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:61 [2020-12-09 06:24:51,675 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:51,766 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:51,855 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:51,856 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:24:51,856 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-12-09 06:24:51,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:51,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:51,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:51,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:51,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:51,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:51,978 INFO L244 Elim1Store]: Index analysis took 109 ms [2020-12-09 06:24:52,095 INFO L348 Elim1Store]: treesize reduction 151, result has 22.6 percent of original size [2020-12-09 06:24:52,095 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2020-12-09 06:24:52,097 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:52,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,131 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2020-12-09 06:24:52,131 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:52,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,165 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2020-12-09 06:24:52,166 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:52,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,202 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2020-12-09 06:24:52,203 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:52,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:24:52,231 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2020-12-09 06:24:52,232 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 06:24:52,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:24:52,322 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:52,323 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 5 xjuncts. [2020-12-09 06:24:52,323 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:373, output treesize:144 [2020-12-09 06:24:52,323 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:52,510 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:52,626 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:52,627 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:52,628 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:52,629 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:24:52,630 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:52,630 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:52,631 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:24:52,632 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 06:24:52,638 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:24:58,663 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32))) [2020-12-09 06:25:00,666 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32))) [2020-12-09 06:25:02,670 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32))) [2020-12-09 06:25:04,673 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32))) [2020-12-09 06:25:06,676 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32))) [2020-12-09 06:25:08,679 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32))) [2020-12-09 06:25:10,682 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32))) [2020-12-09 06:25:12,685 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32))) [2020-12-09 06:25:14,688 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:25:16,691 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:25:18,695 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:25:20,700 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:25:22,704 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv15 32)))) [2020-12-09 06:25:24,707 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv15 32)))) [2020-12-09 06:25:26,710 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv16 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:25:28,713 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv16 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:25:30,718 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:25:32,721 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:25:34,724 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:25:36,729 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:25:36,729 INFO L244 Elim1Store]: Index analysis took 40071 ms [2020-12-09 06:25:38,733 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:25:40,737 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:25:42,742 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:25:44,747 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:25:46,751 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:25:48,755 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:25:50,759 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:25:52,762 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:25:52,763 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 13 [2020-12-09 06:25:52,764 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:25:58,786 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv9 32))) [2020-12-09 06:26:00,791 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv9 32))) [2020-12-09 06:26:02,795 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv10 32)) (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:04,799 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv10 32)) (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:06,802 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv11 32)) (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:08,806 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv11 32)) (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:10,810 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv12 32))) [2020-12-09 06:26:12,814 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv12 32))) [2020-12-09 06:26:14,817 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv10 32)) (select .cse0 (_ bv9 32)))) [2020-12-09 06:26:16,821 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv10 32)) (select .cse0 (_ bv9 32)))) [2020-12-09 06:26:18,825 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv9 32)))) [2020-12-09 06:26:20,829 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv9 32)))) [2020-12-09 06:26:22,833 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv9 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:26:24,837 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv9 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:26:26,840 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv10 32)))) [2020-12-09 06:26:28,843 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv10 32)))) [2020-12-09 06:26:30,848 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv10 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:26:32,852 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv10 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:26:34,856 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:26:36,861 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:26:36,861 INFO L244 Elim1Store]: Index analysis took 40078 ms [2020-12-09 06:26:38,865 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv9 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:40,870 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv9 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:42,874 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv10 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:44,878 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv10 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:46,883 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv11 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:48,886 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv11 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:50,890 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv12 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:52,894 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv12 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:26:52,895 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 13 [2020-12-09 06:26:52,896 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:26:58,915 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32))) [2020-12-09 06:27:02,011 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32))) [2020-12-09 06:27:04,014 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32))) [2020-12-09 06:27:06,017 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32))) [2020-12-09 06:27:11,366 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv19 32)) (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:27:14,551 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:27:16,555 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:27:23,401 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:27:27,212 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv19 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:27:29,218 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv19 32)) (select .cse0 (_ bv18 32)))) [2020-12-09 06:27:30,724 INFO L244 Elim1Store]: Index analysis took 33811 ms [2020-12-09 06:27:37,530 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:27:39,535 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:27:41,538 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:27:43,541 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv19 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:27:45,317 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 13 [2020-12-09 06:27:45,319 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 06:27:51,018 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv10 32)) (select (select |v_#memory_$Pointer$.offset_74| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:27:58,537 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv10 32)))) [2020-12-09 06:28:00,541 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv10 32)))) [2020-12-09 06:28:08,576 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv13 32)))) [2020-12-09 06:28:11,374 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv13 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:28:12,394 INFO L244 Elim1Store]: Index analysis took 23647 ms [2020-12-09 06:28:17,146 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv11 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:28:19,893 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv12 32)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:28:21,360 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 13 [2020-12-09 06:28:21,361 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:31,171 INFO L244 Elim1Store]: Index analysis took 7237 ms [2020-12-09 06:28:33,896 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 13 [2020-12-09 06:28:33,897 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:37,105 INFO L244 Elim1Store]: Index analysis took 2903 ms [2020-12-09 06:28:37,539 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 13 [2020-12-09 06:28:37,540 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:38,069 INFO L244 Elim1Store]: Index analysis took 505 ms [2020-12-09 06:28:38,232 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 13 [2020-12-09 06:28:38,233 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:38,357 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 26 [2020-12-09 06:28:38,357 INFO L348 Elim1Store]: treesize reduction 323, result has 12.0 percent of original size [2020-12-09 06:28:38,358 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 62 [2020-12-09 06:28:38,359 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:38,376 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 13 [2020-12-09 06:28:38,376 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:38,426 INFO L625 ElimStorePlain]: treesize reduction 63, result has 35.7 percent of original size [2020-12-09 06:28:38,427 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 06:28:38,428 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:507, output treesize:13 [2020-12-09 06:28:38,476 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 06:28:38,476 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:38,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:38,478 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 06:28:38,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-09 06:28:38,534 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 06:28:38,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:28:38,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013062250] [2020-12-09 06:28:38,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:28:38,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-12-09 06:28:38,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522791824] [2020-12-09 06:28:38,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 06:28:38,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:28:38,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 06:28:38,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=622, Unknown=1, NotChecked=0, Total=702 [2020-12-09 06:28:38,535 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 27 states. [2020-12-09 06:28:39,401 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-12-09 06:28:39,570 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-12-09 06:28:39,810 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-09 06:28:40,194 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-12-09 06:28:40,405 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2020-12-09 06:28:40,639 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-12-09 06:28:40,928 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-12-09 06:28:41,228 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-12-09 06:28:41,464 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-12-09 06:28:41,891 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-12-09 06:28:42,457 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2020-12-09 06:28:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:28:44,009 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2020-12-09 06:28:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 06:28:44,009 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2020-12-09 06:28:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:28:44,010 INFO L225 Difference]: With dead ends: 123 [2020-12-09 06:28:44,010 INFO L226 Difference]: Without dead ends: 123 [2020-12-09 06:28:44,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=502, Invalid=2047, Unknown=1, NotChecked=0, Total=2550 [2020-12-09 06:28:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-09 06:28:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2020-12-09 06:28:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-12-09 06:28:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2020-12-09 06:28:44,012 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 47 [2020-12-09 06:28:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:28:44,012 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2020-12-09 06:28:44,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 06:28:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2020-12-09 06:28:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-09 06:28:44,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:28:44,012 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:28:44,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 mathsat -unsat_core_generation=3 [2020-12-09 06:28:44,213 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:28:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:28:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1140994340, now seen corresponding path program 1 times [2020-12-09 06:28:44,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:28:44,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107811375] [2020-12-09 06:28:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 55 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with mathsat -unsat_core_generation=3 [2020-12-09 06:28:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:28:44,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 52 conjunts are in the unsatisfiable core [2020-12-09 06:28:44,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:28:44,468 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 06:28:44,468 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:44,473 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:44,473 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:28:44,473 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:28:44,513 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:44,513 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 06:28:44,514 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:44,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:44,525 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:28:44,525 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:28:44,601 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:44,601 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 18 treesize of output 28 [2020-12-09 06:28:44,602 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:44,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:44,617 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:28:44,618 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:22 [2020-12-09 06:28:44,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:28:44,740 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:44,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:44,762 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 06:28:44,762 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:40 [2020-12-09 06:28:45,004 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:45,004 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 67 treesize of output 79 [2020-12-09 06:28:45,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:28:45,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:28:45,006 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:45,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:45,032 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 06:28:45,033 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:45 [2020-12-09 06:28:45,038 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_75|], 2=[|v_#memory_$Pointer$.base_99|]} [2020-12-09 06:28:45,045 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-09 06:28:45,046 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:45,090 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:45,094 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 43 treesize of output 30 [2020-12-09 06:28:45,095 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:45,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:45,135 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:28:45,135 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:65 [2020-12-09 06:28:45,339 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2020-12-09 06:28:45,340 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:45,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:45,377 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 06:28:45,377 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:61 [2020-12-09 06:28:45,638 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:45,638 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 06:28:45,639 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:45,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:45,662 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 06:28:45,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2020-12-09 06:28:46,147 INFO L348 Elim1Store]: treesize reduction 301, result has 12.2 percent of original size [2020-12-09 06:28:46,147 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 66 [2020-12-09 06:28:46,148 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:46,207 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:46,208 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:46,208 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 06:28:46,208 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:96, output treesize:79 [2020-12-09 06:28:46,209 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:46,348 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:46,475 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:46,475 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 06:28:46,476 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-12-09 06:28:46,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,568 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 21 [2020-12-09 06:28:46,569 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:46,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,709 INFO L244 Elim1Store]: Index analysis took 128 ms [2020-12-09 06:28:46,860 INFO L348 Elim1Store]: treesize reduction 151, result has 22.6 percent of original size [2020-12-09 06:28:46,861 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 68 [2020-12-09 06:28:46,862 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:46,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,904 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 21 [2020-12-09 06:28:46,905 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:46,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,946 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 21 [2020-12-09 06:28:46,947 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:46,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:28:46,980 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 21 [2020-12-09 06:28:46,981 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 06:28:47,159 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-12-09 06:28:47,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:28:47,161 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:47,161 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 5 xjuncts. [2020-12-09 06:28:47,161 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:471, output treesize:242 [2020-12-09 06:28:47,162 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:47,466 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-12-09 06:28:47,470 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:47,614 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:28:47,617 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:28:47,618 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:28:47,619 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:47,620 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:47,620 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:28:47,621 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 06:28:47,623 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 7 disjuncts [2020-12-09 06:28:47,628 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 06:28:53,656 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv14 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:28:55,659 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv14 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:28:57,663 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:28:59,666 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:01,670 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32))) [2020-12-09 06:29:03,675 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32))) [2020-12-09 06:29:05,679 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:07,683 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:09,687 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv15 32)))) [2020-12-09 06:29:11,692 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv15 32)))) [2020-12-09 06:29:13,697 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:29:15,701 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:29:17,705 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:29:19,709 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv17 32)))) [2020-12-09 06:29:21,713 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:29:23,717 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:29:25,723 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv15 32)))) [2020-12-09 06:29:27,727 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv15 32)))) [2020-12-09 06:29:29,730 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:29:31,734 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:29:31,734 INFO L244 Elim1Store]: Index analysis took 40082 ms [2020-12-09 06:29:33,738 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv14 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:35,742 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv14 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:37,746 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:39,749 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:41,755 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:43,759 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:45,764 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:47,771 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:29:47,772 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2020-12-09 06:29:47,773 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:29:53,797 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv11 32))) [2020-12-09 06:29:55,801 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv11 32))) [2020-12-09 06:29:57,806 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv12 32))) [2020-12-09 06:29:59,809 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv12 32))) [2020-12-09 06:30:01,813 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv13 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:03,818 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv13 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:05,821 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv14 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:07,825 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv14 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:09,828 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:30:11,832 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv11 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:30:13,836 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv13 32)) (select .cse0 (_ bv11 32)))) [2020-12-09 06:30:15,839 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv13 32)) (select .cse0 (_ bv11 32)))) [2020-12-09 06:30:17,842 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv11 32)))) [2020-12-09 06:30:19,846 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv11 32)))) [2020-12-09 06:30:21,850 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv13 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:30:23,854 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv13 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:30:25,859 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:30:27,863 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv14 32)) (select .cse0 (_ bv12 32)))) [2020-12-09 06:30:29,866 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv13 32)) (select .cse0 (_ bv14 32)))) [2020-12-09 06:30:31,869 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base))) (= (select .cse0 (_ bv13 32)) (select .cse0 (_ bv14 32)))) [2020-12-09 06:30:31,869 INFO L244 Elim1Store]: Index analysis took 40076 ms [2020-12-09 06:30:33,873 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv11 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:35,877 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv11 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:37,880 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv12 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:39,883 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv12 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:41,886 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv13 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:43,888 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv13 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:45,892 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv14 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:47,895 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev.base) (_ bv14 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:47,896 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2020-12-09 06:30:47,898 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:30:53,917 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:55,922 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:30:57,927 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32))) [2020-12-09 06:30:59,931 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32))) [2020-12-09 06:31:01,935 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:03,938 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:05,943 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32))) [2020-12-09 06:31:07,948 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.base_102| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32))) [2020-12-09 06:31:09,951 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:31:11,955 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:31:13,959 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv15 32)))) [2020-12-09 06:31:15,963 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv15 32)))) [2020-12-09 06:31:17,967 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv18 32)))) [2020-12-09 06:31:19,970 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv15 32)) (select .cse0 (_ bv18 32)))) [2020-12-09 06:31:21,973 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:31:23,976 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:31:25,981 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:31:27,984 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv18 32)) (select .cse0 (_ bv16 32)))) [2020-12-09 06:31:29,986 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv18 32)))) [2020-12-09 06:31:31,990 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base))) (= (select .cse0 (_ bv17 32)) (select .cse0 (_ bv18 32)))) [2020-12-09 06:31:31,990 INFO L244 Elim1Store]: Index analysis took 40077 ms [2020-12-09 06:31:33,996 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:36,000 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv15 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:38,004 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:40,009 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv16 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:42,012 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:44,015 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv17 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:46,019 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:48,023 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ldv_arvo_init_arvo_device_struct_~arvo.base) (_ bv18 32)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_entry_point_~intf~2.base) (bvadd ULTIMATE.start_entry_point_~intf~2.offset (_ bv4 32)))) [2020-12-09 06:31:48,024 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2020-12-09 06:31:48,025 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-09 06:31:56,073 INFO L244 Elim1Store]: Index analysis took 4034 ms [2020-12-09 06:31:56,176 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 26 [2020-12-09 06:31:56,177 INFO L348 Elim1Store]: treesize reduction 323, result has 12.0 percent of original size [2020-12-09 06:31:56,177 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 68 [2020-12-09 06:31:56,178 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:04,354 INFO L244 Elim1Store]: Index analysis took 7075 ms [2020-12-09 06:32:08,570 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2020-12-09 06:32:08,572 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:10,824 INFO L244 Elim1Store]: Index analysis took 1979 ms [2020-12-09 06:32:11,464 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2020-12-09 06:32:11,465 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:11,705 INFO L244 Elim1Store]: Index analysis took 218 ms [2020-12-09 06:32:11,815 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2020-12-09 06:32:11,816 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:11,904 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2020-12-09 06:32:11,905 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:11,943 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 21 [2020-12-09 06:32:11,944 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:12,038 INFO L625 ElimStorePlain]: treesize reduction 81, result has 48.1 percent of original size [2020-12-09 06:32:12,040 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 06:32:12,040 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:685, output treesize:23 [2020-12-09 06:32:12,122 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 06:32:12,123 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:12,129 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:12,130 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 06:32:12,130 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:3 [2020-12-09 06:32:12,222 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 06:32:12,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:32:12,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107811375] [2020-12-09 06:32:12,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:32:12,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-12-09 06:32:12,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452074608] [2020-12-09 06:32:12,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 06:32:12,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:32:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 06:32:12,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=620, Unknown=2, NotChecked=0, Total=702 [2020-12-09 06:32:12,223 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 27 states. [2020-12-09 06:32:13,224 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-12-09 06:32:13,458 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-12-09 06:32:13,775 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-12-09 06:32:20,141 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-12-09 06:32:20,541 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2020-12-09 06:32:21,029 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2020-12-09 06:32:21,867 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-09 06:32:22,083 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-09 06:32:24,518 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-09 06:32:35,250 WARN L197 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2020-12-09 06:32:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:32:57,315 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-12-09 06:32:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-09 06:32:57,316 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2020-12-09 06:32:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:32:57,317 INFO L225 Difference]: With dead ends: 121 [2020-12-09 06:32:57,317 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 06:32:57,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=511, Invalid=2122, Unknown=19, NotChecked=0, Total=2652 [2020-12-09 06:32:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 06:32:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2020-12-09 06:32:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-09 06:32:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2020-12-09 06:32:57,318 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 48 [2020-12-09 06:32:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:32:57,319 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2020-12-09 06:32:57,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 06:32:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2020-12-09 06:32:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-09 06:32:57,319 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:32:57,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:32:57,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 mathsat -unsat_core_generation=3 [2020-12-09 06:32:57,520 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:32:57,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:32:57,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1011086369, now seen corresponding path program 1 times [2020-12-09 06:32:57,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:32:57,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369857540] [2020-12-09 06:32:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 56 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with mathsat -unsat_core_generation=3 [2020-12-09 06:32:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:32:57,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 54 conjunts are in the unsatisfiable core [2020-12-09 06:32:57,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:32:57,756 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 06:32:57,756 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:57,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:57,762 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:32:57,762 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:32:57,803 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:57,804 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 06:32:57,805 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:57,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:57,817 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:32:57,817 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:32:57,923 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:57,923 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 22 treesize of output 69 [2020-12-09 06:32:57,925 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:57,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:57,949 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:32:57,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:36 [2020-12-09 06:32:58,080 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:32:58,081 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:58,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:58,108 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 06:32:58,108 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:54 [2020-12-09 06:32:58,279 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:58,279 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 71 treesize of output 83 [2020-12-09 06:32:58,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:32:58,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:32:58,282 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:58,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:58,306 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 06:32:58,306 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:54 [2020-12-09 06:32:58,313 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_76|], 2=[|v_#memory_$Pointer$.base_105|]} [2020-12-09 06:32:58,320 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-09 06:32:58,321 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:58,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:58,361 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 47 treesize of output 34 [2020-12-09 06:32:58,362 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:58,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:58,390 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:32:58,391 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:74 [2020-12-09 06:32:58,558 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2020-12-09 06:32:58,559 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:58,588 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:58,589 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 06:32:58,589 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:70 [2020-12-09 06:32:58,887 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:58,887 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 37 treesize of output 133 [2020-12-09 06:32:58,889 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:58,938 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:58,939 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 06:32:58,939 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:83 [2020-12-09 06:32:59,408 INFO L348 Elim1Store]: treesize reduction 154, result has 0.6 percent of original size [2020-12-09 06:32:59,408 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 39 [2020-12-09 06:32:59,409 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:59,450 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:59,450 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 06:32:59,451 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:132, output treesize:88 [2020-12-09 06:32:59,469 INFO L348 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2020-12-09 06:32:59,469 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 37 [2020-12-09 06:32:59,470 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:59,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:59,510 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 06:32:59,510 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:134, output treesize:88 [2020-12-09 06:32:59,530 INFO L348 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2020-12-09 06:32:59,530 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 37 [2020-12-09 06:32:59,531 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:32:59,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:32:59,573 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 06:32:59,573 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:131, output treesize:85 [2020-12-09 06:33:00,273 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 35 treesize of output 41 [2020-12-09 06:33:00,274 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:00,342 INFO L625 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2020-12-09 06:33:00,342 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 06:33:00,343 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:75 [2020-12-09 06:33:00,484 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:00,484 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 84 treesize of output 35 [2020-12-09 06:33:00,486 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 06:33:00,521 INFO L625 ElimStorePlain]: treesize reduction 4, result has 90.2 percent of original size [2020-12-09 06:33:00,523 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 06:33:00,523 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:94, output treesize:39 [2020-12-09 06:33:00,632 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 06:33:00,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:33:00,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369857540] [2020-12-09 06:33:00,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:33:00,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-12-09 06:33:00,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659216928] [2020-12-09 06:33:00,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 06:33:00,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:33:00,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 06:33:00,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=435, Unknown=45, NotChecked=0, Total=552 [2020-12-09 06:33:00,633 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 24 states. [2020-12-09 06:33:14,071 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-12-09 06:33:14,287 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 06:33:14,505 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-12-09 06:33:15,044 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2020-12-09 06:33:15,508 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2020-12-09 06:33:15,916 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2020-12-09 06:33:16,325 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-12-09 06:33:17,680 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-12-09 06:33:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:33:18,535 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2020-12-09 06:33:18,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 06:33:18,536 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2020-12-09 06:33:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:33:18,536 INFO L225 Difference]: With dead ends: 114 [2020-12-09 06:33:18,536 INFO L226 Difference]: Without dead ends: 114 [2020-12-09 06:33:18,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=401, Invalid=1440, Unknown=139, NotChecked=0, Total=1980 [2020-12-09 06:33:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-09 06:33:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2020-12-09 06:33:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-09 06:33:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2020-12-09 06:33:18,538 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 49 [2020-12-09 06:33:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:33:18,538 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2020-12-09 06:33:18,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 06:33:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2020-12-09 06:33:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-09 06:33:18,538 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:33:18,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:33:18,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 mathsat -unsat_core_generation=3 [2020-12-09 06:33:18,739 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:33:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:33:18,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1594060904, now seen corresponding path program 1 times [2020-12-09 06:33:18,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:33:18,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838083894] [2020-12-09 06:33:18,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 57 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with mathsat -unsat_core_generation=3 [2020-12-09 06:33:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:33:19,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 66 conjunts are in the unsatisfiable core [2020-12-09 06:33:19,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:33:19,020 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 06:33:19,021 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,025 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,025 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:11 [2020-12-09 06:33:19,064 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,065 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 06:33:19,066 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,077 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,078 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,078 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-12-09 06:33:19,145 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,145 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 06:33:19,146 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,157 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,157 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2020-12-09 06:33:19,236 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:33:19,237 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,252 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 06:33:19,252 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2020-12-09 06:33:19,370 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,370 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 06:33:19,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-09 06:33:19,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:33:19,372 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,387 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 06:33:19,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:31 [2020-12-09 06:33:19,390 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_77|], 2=[|v_#memory_$Pointer$.base_111|]} [2020-12-09 06:33:19,395 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-09 06:33:19,396 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,427 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 34 treesize of output 27 [2020-12-09 06:33:19,428 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,452 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,453 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2020-12-09 06:33:19,795 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_78|], 6=[|v_#memory_$Pointer$.base_112|]} [2020-12-09 06:33:19,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:19,803 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-12-09 06:33:19,804 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:19,849 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2020-12-09 06:33:19,849 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:19,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:19,888 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 06:33:19,888 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:51 [2020-12-09 06:33:20,005 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2020-12-09 06:33:20,006 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:20,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:20,027 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 06:33:20,028 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:47 [2020-12-09 06:33:20,201 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2020-12-09 06:33:20,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:20,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:20,213 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 06:33:20,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:10 [2020-12-09 06:33:20,264 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 06:33:20,265 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:20,275 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-12-09 06:33:20,276 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 06:33:20,276 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:13 [2020-12-09 06:33:20,348 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 06:33:20,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:33:20,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838083894] [2020-12-09 06:33:20,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:33:20,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-09 06:33:20,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471500002] [2020-12-09 06:33:20,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 06:33:20,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:33:20,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 06:33:20,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=401, Unknown=4, NotChecked=0, Total=462 [2020-12-09 06:33:20,349 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 22 states. [2020-12-09 06:33:40,455 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-09 06:33:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:33:43,733 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2020-12-09 06:33:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 06:33:43,734 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2020-12-09 06:33:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:33:43,734 INFO L225 Difference]: With dead ends: 123 [2020-12-09 06:33:43,734 INFO L226 Difference]: Without dead ends: 123 [2020-12-09 06:33:43,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=410, Invalid=1549, Unknown=21, NotChecked=0, Total=1980 [2020-12-09 06:33:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-09 06:33:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2020-12-09 06:33:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-09 06:33:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2020-12-09 06:33:43,736 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 49 [2020-12-09 06:33:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:33:43,736 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2020-12-09 06:33:43,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 06:33:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2020-12-09 06:33:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 06:33:43,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:33:43,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:33:43,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 mathsat -unsat_core_generation=3 [2020-12-09 06:33:43,938 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:33:43,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:33:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1405587760, now seen corresponding path program 1 times [2020-12-09 06:33:43,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:33:43,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937190506] [2020-12-09 06:33:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 58 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with mathsat -unsat_core_generation=3 [2020-12-09 06:33:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:33:44,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 52 conjunts are in the unsatisfiable core [2020-12-09 06:33:44,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:33:44,260 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 13 treesize of output 9 [2020-12-09 06:33:44,261 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,280 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 15 treesize of output 11 [2020-12-09 06:33:44,280 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,293 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,293 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2020-12-09 06:33:44,418 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,418 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 06:33:44,419 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,434 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,434 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2020-12-09 06:33:44,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,640 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 13 [2020-12-09 06:33:44,641 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,694 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,706 INFO L348 Elim1Store]: treesize reduction 154, result has 0.6 percent of original size [2020-12-09 06:33:44,706 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 3 case distinctions, treesize of input 60 treesize of output 15 [2020-12-09 06:33:44,707 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,723 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,723 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:31 [2020-12-09 06:33:44,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,753 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2020-12-09 06:33:44,754 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,802 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,813 INFO L348 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2020-12-09 06:33:44,813 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 3 case distinctions, treesize of input 64 treesize of output 15 [2020-12-09 06:33:44,814 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,828 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,828 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:135, output treesize:31 [2020-12-09 06:33:44,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:33:44,853 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2020-12-09 06:33:44,854 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,908 INFO L348 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2020-12-09 06:33:44,908 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 3 case distinctions, treesize of input 64 treesize of output 15 [2020-12-09 06:33:44,909 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:44,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:44,924 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 06:33:44,924 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:135, output treesize:27 [2020-12-09 06:33:45,006 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 06:33:45,007 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:45,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:45,017 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 06:33:45,017 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-12-09 06:33:45,200 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:45,201 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 27 treesize of output 14 [2020-12-09 06:33:45,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:33:45,204 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:33:45,204 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 06:33:45,204 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2020-12-09 06:33:45,251 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 06:33:45,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:33:45,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937190506] [2020-12-09 06:33:45,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:33:45,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-12-09 06:33:45,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811951974] [2020-12-09 06:33:45,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 06:33:45,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:33:45,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 06:33:45,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=390, Unknown=1, NotChecked=0, Total=462 [2020-12-09 06:33:45,252 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 22 states. [2020-12-09 06:33:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:33:56,815 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2020-12-09 06:33:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 06:33:56,815 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2020-12-09 06:33:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:33:56,816 INFO L225 Difference]: With dead ends: 132 [2020-12-09 06:33:56,816 INFO L226 Difference]: Without dead ends: 132 [2020-12-09 06:33:56,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=361, Invalid=1358, Unknown=3, NotChecked=0, Total=1722 [2020-12-09 06:33:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-09 06:33:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2020-12-09 06:33:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-09 06:33:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2020-12-09 06:33:56,818 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 50 [2020-12-09 06:33:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:33:56,818 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2020-12-09 06:33:56,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 06:33:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2020-12-09 06:33:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-09 06:33:56,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:33:56,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:33:57,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 mathsat -unsat_core_generation=3 [2020-12-09 06:33:57,020 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-09 06:33:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:33:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash 662643522, now seen corresponding path program 1 times [2020-12-09 06:33:57,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:33:57,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822618388] [2020-12-09 06:33:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/mathsat Starting monitored process 59 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with mathsat -unsat_core_generation=3 [2020-12-09 06:33:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:33:57,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:33:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:33:57,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:33:57,653 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-12-09 06:33:57,654 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 06:33:57,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 mathsat -unsat_core_generation=3 [2020-12-09 06:33:57,865 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,866 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,866 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,866 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,866 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,867 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,867 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,867 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,867 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,868 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,868 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,868 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,868 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,868 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,869 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,869 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,869 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,869 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,870 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,870 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,870 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,870 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,871 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,871 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,871 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,871 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,872 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,872 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,872 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,872 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,873 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,873 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,873 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,873 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,874 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,874 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,874 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,874 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,875 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,875 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,878 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,879 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,879 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,879 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,880 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,880 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,880 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,880 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,881 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,881 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,881 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,881 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,882 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,882 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,882 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,883 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,883 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,883 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,883 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,884 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,884 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,884 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,884 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,885 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,885 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,885 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,885 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,886 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,886 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,886 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,886 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,886 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,887 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,887 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,887 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,887 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,888 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,888 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,888 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,888 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,888 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,889 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,889 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,889 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,889 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,889 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,890 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,890 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,890 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,890 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,891 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,891 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,891 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,891 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,891 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,892 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,892 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,892 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,892 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,892 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:33:57 BoogieIcfgContainer [2020-12-09 06:33:57,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 06:33:57,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 06:33:57,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 06:33:57,919 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 06:33:57,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:20:43" (3/4) ... [2020-12-09 06:33:57,921 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 06:33:57,923 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,923 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,923 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,923 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,923 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,923 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,924 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,924 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,924 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,924 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,924 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,924 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,924 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,924 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,924 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,928 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,928 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,928 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,928 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,928 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,928 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,928 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,929 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,929 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,929 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,929 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,929 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,929 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,929 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,930 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,930 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,930 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,930 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,930 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,930 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,930 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,930 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,931 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,931 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,931 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,931 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,931 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,931 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,931 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,932 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,932 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,932 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,932 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,932 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,932 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,932 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,933 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,933 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,933 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,933 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,933 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,933 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,934 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,934 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,934 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,934 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,934 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,934 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,935 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,935 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,935 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,935 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,935 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,935 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,936 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,936 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,936 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,936 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,936 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,937 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-09 06:33:57,978 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_117e9054-a4dd-4fa8-8fc6-f09b7bd2fada/bin/utaipan/witness.graphml [2020-12-09 06:33:57,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 06:33:57,979 INFO L168 Benchmark]: Toolchain (without parser) took 795248.04 ms. Allocated memory was 62.9 MB in the beginning and 130.0 MB in the end (delta: 67.1 MB). Free memory was 40.5 MB in the beginning and 83.4 MB in the end (delta: -42.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 16.1 GB. [2020-12-09 06:33:57,979 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 62.9 MB. Free memory was 44.8 MB in the beginning and 44.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:33:57,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.55 ms. Allocated memory was 62.9 MB in the beginning and 107.0 MB in the end (delta: 44.0 MB). Free memory was 40.3 MB in the beginning and 70.1 MB in the end (delta: -29.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2020-12-09 06:33:57,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.64 ms. Allocated memory is still 107.0 MB. Free memory was 70.1 MB in the beginning and 67.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 06:33:57,980 INFO L168 Benchmark]: Boogie Preprocessor took 28.77 ms. Allocated memory is still 107.0 MB. Free memory was 67.1 MB in the beginning and 64.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:33:57,980 INFO L168 Benchmark]: RCFGBuilder took 568.43 ms. Allocated memory is still 107.0 MB. Free memory was 64.5 MB in the beginning and 82.2 MB in the end (delta: -17.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. [2020-12-09 06:33:57,980 INFO L168 Benchmark]: TraceAbstraction took 794066.18 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 80.9 MB in the beginning and 94.9 MB in the end (delta: -14.0 MB). Peak memory consumption was 78.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:33:57,980 INFO L168 Benchmark]: Witness Printer took 59.77 ms. Allocated memory is still 130.0 MB. Free memory was 94.9 MB in the beginning and 83.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 06:33:57,981 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.11 ms. Allocated memory is still 62.9 MB. Free memory was 44.8 MB in the beginning and 44.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 473.55 ms. Allocated memory was 62.9 MB in the beginning and 107.0 MB in the end (delta: 44.0 MB). Free memory was 40.3 MB in the beginning and 70.1 MB in the end (delta: -29.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.64 ms. Allocated memory is still 107.0 MB. Free memory was 70.1 MB in the beginning and 67.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.77 ms. Allocated memory is still 107.0 MB. Free memory was 67.1 MB in the beginning and 64.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 568.43 ms. Allocated memory is still 107.0 MB. Free memory was 64.5 MB in the beginning and 82.2 MB in the end (delta: -17.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 794066.18 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 80.9 MB in the beginning and 94.9 MB in the end (delta: -14.0 MB). Peak memory consumption was 78.1 MB. Max. memory is 16.1 GB. * Witness Printer took 59.77 ms. Allocated memory is still 130.0 MB. Free memory was 94.9 MB in the beginning and 83.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 805]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={15:0}] [L533] return calloc(size, 1); VAL [ldv_global_msg_list={15:0}] [L821] struct ldv_hid_device *hdev = (struct ldv_hid_device *)ldv_zalloc(sizeof(struct ldv_hid_device)); [L822] COND FALSE !(!hdev) [L533] return calloc(size, 1); VAL [ldv_global_msg_list={15:0}] [L823] struct ldv_usb_interface *intf = (struct ldv_usb_interface*)ldv_zalloc(sizeof(struct ldv_usb_interface)); [L824] COND FALSE !(!intf) [L533] return calloc(size, 1); VAL [ldv_global_msg_list={15:0}] [L825] intf->cur_altsetting = (struct ldv_usb_host_interface *)ldv_zalloc(sizeof(struct ldv_usb_host_interface)) VAL [ldv_global_msg_list={15:0}] [L826] EXPR intf->cur_altsetting VAL [ldv_global_msg_list={15:0}] [L826] COND FALSE !(!intf->cur_altsetting) [L827] EXPR intf->cur_altsetting VAL [ldv_global_msg_list={15:0}] [L827] intf->cur_altsetting->desc.bInterfaceProtocol = (char)__VERIFIER_nondet_int() VAL [ldv_global_msg_list={15:0}] [L828] hdev->dev.parent = &intf->dev VAL [ldv_global_msg_list={15:0}] [L808] int retval; [L778] struct ldv_arvo_device *arvo; [L779] int retval; VAL [ldv_global_msg_list={15:0}] [L780] EXPR hdev->dev.parent VAL [ldv_global_msg_list={15:0}] [L780] const typeof( ((struct ldv_usb_interface *)0)->dev ) *__mptr = (hdev->dev.parent); [L780] struct ldv_usb_interface *intf = ({ const typeof( ((struct ldv_usb_interface *)0)->dev ) *__mptr = (hdev->dev.parent); (struct ldv_usb_interface *)( (char *)__mptr - ((size_t) &((struct ldv_usb_interface *)0)->dev) );}); VAL [ldv_global_msg_list={15:0}] [L781] EXPR intf->cur_altsetting VAL [ldv_global_msg_list={15:0}] [L781] EXPR intf->cur_altsetting->desc.bInterfaceProtocol VAL [ldv_global_msg_list={15:0}] [L781] COND FALSE !(intf->cur_altsetting->desc.bInterfaceProtocol == 7) [L533] return calloc(size, 1); VAL [ldv_global_msg_list={15:0}] [L785] arvo = (struct ldv_arvo_device*)ldv_zalloc(sizeof(struct ldv_arvo_device)) [L786] COND FALSE !(!arvo) [L772] arvo->a = __VERIFIER_nondet_int() VAL [ldv_global_msg_list={15:0}] [L773] arvo->b = __VERIFIER_nondet_int() VAL [ldv_global_msg_list={15:0}] [L774] arvo->c = __VERIFIER_nondet_int() VAL [ldv_global_msg_list={15:0}] [L514] int r = __VERIFIER_nondet_int(); [L515] COND FALSE !(r<0) [L516] return 0; VAL [ldv_global_msg_list={15:0}] [L775] return ldv_nonpositive(); [L789] retval = ldv_arvo_init_arvo_device_struct(arvo) [L790] COND FALSE !(\read(retval)) [L793] return 0; VAL [ldv_global_msg_list={15:0}] [L809] retval = ldv_arvo_init_specials_unsafe(hdev) [L810] COND FALSE !(\read(retval)) [L813] return 0; VAL [ldv_global_msg_list={15:0}] [L829] COND TRUE ldv_arvo_probe_unsafe(hdev)==0 [L799] EXPR hdev->dev.parent VAL [ldv_global_msg_list={15:0}] [L799] const typeof( ((struct ldv_usb_interface *)0)->dev ) *__mptr = (hdev->dev.parent); [L799] struct ldv_usb_interface *intf = ({ const typeof( ((struct ldv_usb_interface *)0)->dev ) *__mptr = (hdev->dev.parent); (struct ldv_usb_interface *)( (char *)__mptr - ((size_t) &((struct ldv_usb_interface *)0)->dev) );}); [L800] struct ldv_arvo_device *arvo; VAL [ldv_global_msg_list={15:0}] [L801] EXPR intf->cur_altsetting VAL [ldv_global_msg_list={15:0}] [L801] EXPR intf->cur_altsetting->desc.bInterfaceProtocol VAL [ldv_global_msg_list={15:0}] [L801] COND FALSE !(intf->cur_altsetting->desc.bInterfaceProtocol == 7) [L619] EXPR dev->driver_data VAL [ldv_global_msg_list={15:0}] [L619] return dev->driver_data; [L762] return ldv_dev_get_drvdata(&hdev->dev); [L804] arvo = ldv_hid_get_drvdata(hdev) [L805] free(arvo) VAL [ldv_global_msg_list={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 122 locations, 50 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 793.9s, OverallIterations: 58, TraceHistogramMax: 1, AutomataDifference: 290.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4246 SDtfs, 23360 SDslu, 17001 SDs, 0 SdLazy, 19447 SolverSat, 1797 SolverUnsat, 803 SolverUnknown, 0 SolverNotchecked, 220.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2514 GetRequests, 1188 SyntacticMatches, 64 SemanticMatches, 1262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6647 ImplicationChecksByTransitivity, 100.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 57 MinimizatonAttempts, 1909 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 481.3s InterpolantComputationTime, 1963 NumberOfCodeBlocks, 1963 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1855 ConstructedInterpolants, 341 QuantifiedInterpolants, 1748959 SizeOfPredicates, 1469 NumberOfNonLiveVariables, 9978 ConjunctsInSsa, 1783 ConjunctsInUnsatCore, 57 InterpolantComputations, 57 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 proved your program to be incorrect! Received shutdown request...