./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-memsafety/list1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-memsafety/list1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/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 e41652bc5d5e6ecf5f01d273023c8e2664e3cb5e ........................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-memsafety/list1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/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 e41652bc5d5e6ecf5f01d273023c8e2664e3cb5e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:42:39,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:42:39,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:42:39,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:42:39,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:42:39,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:42:39,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:42:39,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:42:39,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:42:39,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:42:39,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:42:39,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:42:39,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:42:39,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:42:39,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:42:39,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:42:39,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:42:39,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:42:39,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:42:39,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:42:39,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:42:39,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:42:39,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:42:39,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:42:39,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:42:39,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:42:39,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:42:39,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:42:39,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:42:39,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:42:39,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:42:39,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:42:39,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:42:39,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:42:39,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:42:39,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:42:39,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:42:39,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:42:39,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:42:39,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:42:39,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:42:39,118 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 16:42:39,131 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:42:39,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:42:39,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:42:39,132 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:42:39,132 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:42:39,132 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:42:39,132 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:42:39,132 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:42:39,132 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:42:39,132 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:42:39,132 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:42:39,133 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:42:39,133 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:42:39,133 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:42:39,133 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:42:39,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:42:39,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:42:39,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:42:39,134 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:42:39,134 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:42:39,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:42:39,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:42:39,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:42:39,134 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:42:39,135 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:42:39,135 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:42:39,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:42:39,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:42:39,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:42:39,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:42:39,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:42:39,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:42:39,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:42:39,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:42:39,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:42:39,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:42:39,136 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:42:39,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:42:39,136 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:42:39,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:42:39,137 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/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 -> e41652bc5d5e6ecf5f01d273023c8e2664e3cb5e [2019-12-07 16:42:39,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:42:39,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:42:39,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:42:39,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:42:39,247 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:42:39,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/../../sv-benchmarks/c/pthread-memsafety/list1.i [2019-12-07 16:42:39,294 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data/22c0640f8/bc378dc1944b45b3a1bb52623952ff6b/FLAG9068ed2e7 [2019-12-07 16:42:39,682 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:42:39,683 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/sv-benchmarks/c/pthread-memsafety/list1.i [2019-12-07 16:42:39,694 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data/22c0640f8/bc378dc1944b45b3a1bb52623952ff6b/FLAG9068ed2e7 [2019-12-07 16:42:39,706 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data/22c0640f8/bc378dc1944b45b3a1bb52623952ff6b [2019-12-07 16:42:39,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:42:39,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:42:39,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:42:39,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:42:39,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:42:39,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:42:39" (1/1) ... [2019-12-07 16:42:39,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b38479e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:39, skipping insertion in model container [2019-12-07 16:42:39,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:42:39" (1/1) ... [2019-12-07 16:42:39,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:42:39,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:42:40,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:42:40,033 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-12-07 16:42:40,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@48dab516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:40, skipping insertion in model container [2019-12-07 16:42:40,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:42:40,034 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 16:42:40,036 INFO L168 Benchmark]: Toolchain (without parser) took 326.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:42:40,036 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:42:40,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:42:40,038 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1048]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 16:42:41,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:42:41,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:42:41,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:42:41,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:42:41,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:42:41,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:42:41,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:42:41,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:42:41,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:42:41,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:42:41,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:42:41,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:42:41,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:42:41,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:42:41,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:42:41,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:42:41,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:42:41,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:42:41,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:42:41,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:42:41,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:42:41,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:42:41,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:42:41,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:42:41,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:42:41,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:42:41,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:42:41,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:42:41,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:42:41,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:42:41,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:42:41,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:42:41,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:42:41,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:42:41,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:42:41,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:42:41,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:42:41,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:42:41,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:42:41,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:42:41,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 16:42:41,232 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:42:41,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:42:41,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:42:41,233 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:42:41,233 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:42:41,233 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:42:41,233 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:42:41,233 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:42:41,233 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:42:41,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:42:41,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:42:41,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:42:41,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:42:41,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:42:41,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:42:41,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:42:41,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:42:41,235 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:42:41,235 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:42:41,235 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:42:41,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:42:41,236 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:42:41,236 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:42:41,236 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:42:41,236 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:42:41,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:42:41,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:42:41,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:42:41,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:42:41,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:42:41,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:42:41,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:42:41,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:42:41,238 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 16:42:41,238 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:42:41,238 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:42:41,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:42:41,238 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/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 -> e41652bc5d5e6ecf5f01d273023c8e2664e3cb5e [2019-12-07 16:42:41,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:42:41,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:42:41,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:42:41,441 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:42:41,442 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:42:41,442 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/../../sv-benchmarks/c/pthread-memsafety/list1.i [2019-12-07 16:42:41,479 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data/20ee4cca4/99d9474766df4d168a29e0a668feeee4/FLAG4011926f8 [2019-12-07 16:42:41,995 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:42:41,996 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/sv-benchmarks/c/pthread-memsafety/list1.i [2019-12-07 16:42:42,008 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data/20ee4cca4/99d9474766df4d168a29e0a668feeee4/FLAG4011926f8 [2019-12-07 16:42:42,510 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/data/20ee4cca4/99d9474766df4d168a29e0a668feeee4 [2019-12-07 16:42:42,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:42:42,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:42:42,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:42:42,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:42:42,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:42:42,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:42,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cb4662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42, skipping insertion in model container [2019-12-07 16:42:42,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:42,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:42:42,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:42:42,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:42:42,847 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 16:42:42,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:42:42,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:42:42,878 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:42:42,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:42:42,985 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:42:42,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42 WrapperNode [2019-12-07 16:42:42,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:42:42,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:42:42,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:42:42,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:42:42,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:43,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:43,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:42:43,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:42:43,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:42:43,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:42:43,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:43,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:43,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:43,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:43,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:43,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:43,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... [2019-12-07 16:42:43,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:42:43,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:42:43,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:42:43,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:42:43,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:42:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 16:42:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:42:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:42:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 16:42:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:42:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 16:42:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:42:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:42:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2019-12-07 16:42:43,109 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2019-12-07 16:42:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure build [2019-12-07 16:42:43,109 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2019-12-07 16:42:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:42:43,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:42:43,111 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 16:42:43,500 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:42:43,500 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:42:43,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:42:43 BoogieIcfgContainer [2019-12-07 16:42:43,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:42:43,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:42:43,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:42:43,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:42:43,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:42:42" (1/3) ... [2019-12-07 16:42:43,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b68aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:42:43, skipping insertion in model container [2019-12-07 16:42:43,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:42:42" (2/3) ... [2019-12-07 16:42:43,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b68aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:42:43, skipping insertion in model container [2019-12-07 16:42:43,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:42:43" (3/3) ... [2019-12-07 16:42:43,507 INFO L109 eAbstractionObserver]: Analyzing ICFG list1.i [2019-12-07 16:42:43,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:42:43,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-12-07 16:42:43,518 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:42:43,543 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_#in~plist.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,544 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_#in~plist.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,544 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,544 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,544 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_~#list~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,544 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_~#list~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,544 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_~#list~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,544 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_~#list~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,545 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,545 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,545 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_~#list~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,545 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_~#list~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,545 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#in~plist.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,545 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#in~plist.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,545 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,546 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,546 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,546 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,546 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,546 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,546 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,546 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,546 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,547 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,547 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,547 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,547 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,547 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc7.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,548 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,548 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,548 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc7.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,548 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,548 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,548 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,549 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#in~plist.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,549 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#in~plist.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,549 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,549 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,549 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,550 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,550 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,550 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,550 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,550 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,551 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,551 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,551 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,551 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,551 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,552 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,552 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,552 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,552 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,552 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,553 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,553 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,553 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,553 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,553 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,554 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,554 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,554 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,554 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,554 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,555 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,555 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,555 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,555 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,555 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,555 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,556 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,556 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,556 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,556 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,556 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,557 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,557 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,557 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,557 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc7.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,558 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc7.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,558 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,558 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,558 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,558 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,559 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,559 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,559 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,559 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc7.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,559 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~malloc7.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,560 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,560 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,560 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,560 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,560 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,560 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,561 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,561 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,561 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,561 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,561 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,562 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,562 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,562 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,562 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~ite8.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,562 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,563 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,563 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,563 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,563 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,563 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_append_#t~mem4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,563 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,564 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~elem~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,564 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,564 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,564 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,564 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,565 WARN L315 ript$VariableManager]: TermVariabe buildThread1of1ForFork1_append_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,565 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,565 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,565 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,565 WARN L315 ript$VariableManager]: TermVariabe |buildThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,568 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#in~plist.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,568 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#in~plist.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,568 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,568 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,568 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~plist.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,568 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~plist.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,569 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,569 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,569 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,569 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,569 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,569 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,570 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,570 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,570 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,570 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,570 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,571 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,571 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,571 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,571 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,571 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,571 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,572 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,572 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,572 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~next~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,572 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~next~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,572 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,572 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,573 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,573 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,573 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,573 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,573 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,573 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,574 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,574 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,574 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,574 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,574 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,574 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~next~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,574 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~next~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,575 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,575 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,575 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,575 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,575 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,575 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,575 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,575 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,576 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,576 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,576 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,576 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,576 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,576 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,576 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,577 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,577 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,577 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,577 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,577 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,577 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,577 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,578 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,578 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,578 WARN L315 ript$VariableManager]: TermVariabe |deleteThread1of1ForFork0_#t~mem11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,578 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~next~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,578 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~next~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,578 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,578 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,579 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,579 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,579 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,579 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,579 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,579 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,579 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,579 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~next~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,580 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~next~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,580 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,580 WARN L315 ript$VariableManager]: TermVariabe deleteThread1of1ForFork0_~list~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:42:43,598 INFO L249 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2019-12-07 16:42:43,611 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:42:43,611 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 16:42:43,611 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:42:43,611 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:42:43,611 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:42:43,611 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:42:43,611 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:42:43,611 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:42:43,622 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 139 transitions [2019-12-07 16:42:43,624 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 138 places, 139 transitions [2019-12-07 16:42:43,658 INFO L134 PetriNetUnfolder]: 6/135 cut-off events. [2019-12-07 16:42:43,658 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:42:43,662 INFO L76 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 135 events. 6/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 412 event pairs. 18/109 useless extension candidates. Maximal degree in co-relation 75. Up to 3 conditions per place. [2019-12-07 16:42:43,664 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 138 places, 139 transitions [2019-12-07 16:42:43,681 INFO L134 PetriNetUnfolder]: 6/135 cut-off events. [2019-12-07 16:42:43,682 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:42:43,683 INFO L76 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 135 events. 6/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 412 event pairs. 18/109 useless extension candidates. Maximal degree in co-relation 75. Up to 3 conditions per place. [2019-12-07 16:42:43,684 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 736 [2019-12-07 16:42:43,685 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:42:44,552 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-12-07 16:42:44,938 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-07 16:42:45,216 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-12-07 16:42:45,928 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-12-07 16:42:48,090 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 16:42:48,201 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 16:42:49,832 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 16:42:50,519 WARN L192 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-07 16:42:51,063 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-12-07 16:42:51,260 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 16:42:52,000 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-12-07 16:42:52,219 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-12-07 16:42:52,384 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 16:42:52,520 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 16:42:52,803 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-07 16:42:52,943 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 16:42:53,126 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-07 16:42:54,269 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 16:42:54,417 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-07 16:42:54,565 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 16:42:55,439 WARN L192 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 16:42:55,790 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 16:42:56,170 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 16:42:56,521 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 16:42:57,156 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 16:42:57,345 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 16:42:57,497 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-12-07 16:42:57,627 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 16:42:57,824 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 16:42:57,961 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 16:42:58,134 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-12-07 16:42:58,378 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 16:42:58,566 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 16:42:59,041 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 16:42:59,308 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 16:42:59,491 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 16:42:59,692 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 16:43:00,080 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 16:43:00,361 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 16:43:01,285 WARN L192 SmtUtils]: Spent 845.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 16:43:02,125 WARN L192 SmtUtils]: Spent 840.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 16:43:02,320 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 16:43:02,522 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 16:43:02,771 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 16:43:02,916 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 16:43:03,110 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 16:43:03,274 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 16:43:03,391 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1142 [2019-12-07 16:43:03,391 INFO L214 etLargeBlockEncoding]: Total number of compositions: 183 [2019-12-07 16:43:03,393 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 66 transitions [2019-12-07 16:43:03,408 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 173 states. [2019-12-07 16:43:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-12-07 16:43:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-07 16:43:03,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:03,415 INFO L410 BasicCegarLoop]: trace histogram [1] [2019-12-07 16:43:03,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:43:03,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash 600, now seen corresponding path program 1 times [2019-12-07 16:43:03,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:43:03,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603872711] [2019-12-07 16:43:03,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 16:43:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:03,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 16:43:03,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:03,475 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:43:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:03,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603872711] [2019-12-07 16:43:03,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:03,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0, 0] imperfect sequences [] total 0 [2019-12-07 16:43:03,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985239126] [2019-12-07 16:43:03,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 16:43:03,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:43:03,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 16:43:03,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 16:43:03,490 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 2 states. [2019-12-07 16:43:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:03,502 INFO L93 Difference]: Finished difference Result 135 states and 233 transitions. [2019-12-07 16:43:03,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 16:43:03,503 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-07 16:43:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:03,512 INFO L225 Difference]: With dead ends: 135 [2019-12-07 16:43:03,512 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 16:43:03,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 16:43:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 16:43:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-12-07 16:43:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 16:43:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 232 transitions. [2019-12-07 16:43:03,544 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 232 transitions. Word has length 1 [2019-12-07 16:43:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:03,544 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 232 transitions. [2019-12-07 16:43:03,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 16:43:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 232 transitions. [2019-12-07 16:43:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:43:03,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:03,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:43:03,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 16:43:03,746 INFO L410 AbstractCegarLoop]: === Iteration 2 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:43:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:03,747 INFO L82 PathProgramCache]: Analyzing trace with hash 588242, now seen corresponding path program 1 times [2019-12-07 16:43:03,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:43:03,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044522281] [2019-12-07 16:43:03,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 16:43:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:03,842 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:43:03,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:03,912 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 16:43:03,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-12-07 16:43:03,913 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:03,947 INFO L614 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-12-07 16:43:03,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:43:03,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:43:03,951 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:27 [2019-12-07 16:43:03,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:43:03,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:43:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:03,981 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:43:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:03,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044522281] [2019-12-07 16:43:03,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:03,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2019-12-07 16:43:03,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800904219] [2019-12-07 16:43:03,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:03,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:43:03,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:03,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:03,991 INFO L87 Difference]: Start difference. First operand 134 states and 232 transitions. Second operand 4 states. [2019-12-07 16:43:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:04,226 INFO L93 Difference]: Finished difference Result 146 states and 249 transitions. [2019-12-07 16:43:04,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:43:04,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 16:43:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:04,227 INFO L225 Difference]: With dead ends: 146 [2019-12-07 16:43:04,227 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 16:43:04,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 16:43:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 120. [2019-12-07 16:43:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 16:43:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 204 transitions. [2019-12-07 16:43:04,236 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 204 transitions. Word has length 3 [2019-12-07 16:43:04,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:04,236 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 204 transitions. [2019-12-07 16:43:04,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 204 transitions. [2019-12-07 16:43:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:43:04,237 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:04,237 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:43:04,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 16:43:04,438 INFO L410 AbstractCegarLoop]: === Iteration 3 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:43:04,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash 588243, now seen corresponding path program 1 times [2019-12-07 16:43:04,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:43:04,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369857397] [2019-12-07 16:43:04,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 16:43:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:04,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:43:04,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:04,532 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_283|], 2=[|v_#valid_397|]} [2019-12-07 16:43:04,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:04,537 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 16:43:04,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:04,547 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:04,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-12-07 16:43:04,552 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:04,568 INFO L614 ElimStorePlain]: treesize reduction 12, result has 60.0 percent of original size [2019-12-07 16:43:04,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:43:04,569 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:18 [2019-12-07 16:43:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:04,584 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:43:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:04,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369857397] [2019-12-07 16:43:04,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:04,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2019-12-07 16:43:04,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176770057] [2019-12-07 16:43:04,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:04,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:43:04,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:04,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:04,605 INFO L87 Difference]: Start difference. First operand 120 states and 204 transitions. Second operand 4 states. [2019-12-07 16:43:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:05,263 INFO L93 Difference]: Finished difference Result 215 states and 365 transitions. [2019-12-07 16:43:05,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:43:05,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 16:43:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:05,265 INFO L225 Difference]: With dead ends: 215 [2019-12-07 16:43:05,265 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 16:43:05,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 16:43:05,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 126. [2019-12-07 16:43:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 16:43:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 217 transitions. [2019-12-07 16:43:05,275 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 217 transitions. Word has length 3 [2019-12-07 16:43:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:05,275 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 217 transitions. [2019-12-07 16:43:05,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 217 transitions. [2019-12-07 16:43:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 16:43:05,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:05,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 16:43:05,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 16:43:05,476 INFO L410 AbstractCegarLoop]: === Iteration 4 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:43:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash 18238074, now seen corresponding path program 1 times [2019-12-07 16:43:05,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:43:05,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645705614] [2019-12-07 16:43:05,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 16:43:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:05,562 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:43:05,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:05,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:43:05,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:05,569 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:05,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:05,569 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:43:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:05,573 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:43:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:05,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645705614] [2019-12-07 16:43:05,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:05,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 16:43:05,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593037939] [2019-12-07 16:43:05,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:43:05,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:43:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:43:05,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:05,585 INFO L87 Difference]: Start difference. First operand 126 states and 217 transitions. Second operand 3 states. [2019-12-07 16:43:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:05,771 INFO L93 Difference]: Finished difference Result 148 states and 255 transitions. [2019-12-07 16:43:05,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:43:05,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 16:43:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:05,773 INFO L225 Difference]: With dead ends: 148 [2019-12-07 16:43:05,773 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 16:43:05,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 16:43:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 122. [2019-12-07 16:43:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 16:43:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-12-07 16:43:05,778 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 4 [2019-12-07 16:43:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:05,778 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-12-07 16:43:05,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:43:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-12-07 16:43:05,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 16:43:05,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:05,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 16:43:05,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 16:43:05,980 INFO L410 AbstractCegarLoop]: === Iteration 5 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:43:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash 18238075, now seen corresponding path program 1 times [2019-12-07 16:43:05,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:43:05,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554837087] [2019-12-07 16:43:05,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 16:43:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:06,069 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:43:06,070 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:06,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:43:06,074 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:06,079 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:06,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:43:06,081 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:06,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:06,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:06,087 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 16:43:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:06,094 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:43:06,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:06,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554837087] [2019-12-07 16:43:06,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:06,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 16:43:06,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090012799] [2019-12-07 16:43:06,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:06,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:43:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:06,150 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 4 states. [2019-12-07 16:43:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:08,501 INFO L93 Difference]: Finished difference Result 171 states and 293 transitions. [2019-12-07 16:43:08,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:43:08,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 16:43:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:08,503 INFO L225 Difference]: With dead ends: 171 [2019-12-07 16:43:08,503 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 16:43:08,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 16:43:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 118. [2019-12-07 16:43:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 16:43:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 203 transitions. [2019-12-07 16:43:08,509 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 203 transitions. Word has length 4 [2019-12-07 16:43:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:08,510 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 203 transitions. [2019-12-07 16:43:08,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 203 transitions. [2019-12-07 16:43:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 16:43:08,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:08,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 16:43:08,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 16:43:08,711 INFO L410 AbstractCegarLoop]: === Iteration 6 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:43:08,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:08,712 INFO L82 PathProgramCache]: Analyzing trace with hash 565382533, now seen corresponding path program 1 times [2019-12-07 16:43:08,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:43:08,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850406289] [2019-12-07 16:43:08,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 16:43:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:08,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 16:43:08,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:08,844 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:43:08,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:08,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 16:43:08,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:08,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 16:43:08,855 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:08,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:08,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 16:43:08,871 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:08,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 16:43:08,873 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:08,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:08,877 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 16:43:08,877 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:7 [2019-12-07 16:43:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:08,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850406289] [2019-12-07 16:43:08,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:08,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:43:08,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730347451] [2019-12-07 16:43:08,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:43:08,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:43:08,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:43:08,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:43:08,879 INFO L87 Difference]: Start difference. First operand 118 states and 203 transitions. Second operand 6 states. [2019-12-07 16:43:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:09,260 INFO L93 Difference]: Finished difference Result 131 states and 220 transitions. [2019-12-07 16:43:09,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:43:09,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-12-07 16:43:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:09,261 INFO L225 Difference]: With dead ends: 131 [2019-12-07 16:43:09,262 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 16:43:09,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:43:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 16:43:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2019-12-07 16:43:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 16:43:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 201 transitions. [2019-12-07 16:43:09,265 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 201 transitions. Word has length 5 [2019-12-07 16:43:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:09,265 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 201 transitions. [2019-12-07 16:43:09,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:43:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 201 transitions. [2019-12-07 16:43:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 16:43:09,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:09,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:43:09,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 16:43:09,467 INFO L410 AbstractCegarLoop]: === Iteration 7 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:43:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:09,467 INFO L82 PathProgramCache]: Analyzing trace with hash 346989235, now seen corresponding path program 1 times [2019-12-07 16:43:09,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:43:09,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054985859] [2019-12-07 16:43:09,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 16:43:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:09,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 16:43:09,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:09,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:43:09,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:09,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:09,651 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:09,651 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-12-07 16:43:09,690 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:43:09,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:43:09,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:09,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:09,725 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:43:09,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:43:09,725 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:09,738 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:09,739 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:43:09,739 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:43 [2019-12-07 16:43:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:09,773 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:43:09,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:09,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:09,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:09,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2019-12-07 16:43:09,810 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:09,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:09,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2019-12-07 16:43:09,828 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:10,483 WARN L192 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-12-07 16:43:10,484 INFO L614 ElimStorePlain]: treesize reduction 18, result has 95.5 percent of original size [2019-12-07 16:43:10,503 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:10,504 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:43:10,504 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:10,788 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 16:43:10,789 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:10,815 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:10,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2019-12-07 16:43:10,815 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:10,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:10,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2019-12-07 16:43:10,834 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:11,067 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 16:43:11,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:11,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:11,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:43:11,093 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:11,340 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 16:43:11,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:11,341 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2019-12-07 16:43:11,341 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:434, output treesize:326 [2019-12-07 16:43:11,908 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-12-07 16:43:12,195 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 16:43:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:12,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054985859] [2019-12-07 16:43:12,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:12,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 8 [2019-12-07 16:43:12,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580263248] [2019-12-07 16:43:12,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:43:12,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:43:12,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:43:12,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:43:12,199 INFO L87 Difference]: Start difference. First operand 118 states and 201 transitions. Second operand 9 states. [2019-12-07 16:43:12,947 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 16:43:13,378 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 16:43:13,822 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 16:43:14,807 WARN L192 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-07 16:43:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:16,436 INFO L93 Difference]: Finished difference Result 138 states and 231 transitions. [2019-12-07 16:43:16,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:43:16,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-12-07 16:43:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:16,439 INFO L225 Difference]: With dead ends: 138 [2019-12-07 16:43:16,439 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 16:43:16,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:43:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 16:43:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 115. [2019-12-07 16:43:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 16:43:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 195 transitions. [2019-12-07 16:43:16,442 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 195 transitions. Word has length 6 [2019-12-07 16:43:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:16,443 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 195 transitions. [2019-12-07 16:43:16,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:43:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 195 transitions. [2019-12-07 16:43:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 16:43:16,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:16,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:16,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 16:43:16,644 INFO L410 AbstractCegarLoop]: === Iteration 8 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:43:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2128235647, now seen corresponding path program 1 times [2019-12-07 16:43:16,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:43:16,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118092493] [2019-12-07 16:43:16,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 16:43:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:16,782 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 16:43:16,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:16,786 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_294|], 5=[|v_#valid_408|]} [2019-12-07 16:43:16,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:16,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 16:43:16,792 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:16,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:16,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:16,851 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-12-07 16:43:16,851 INFO L377 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 2 case distinctions, treesize of input 44 treesize of output 59 [2019-12-07 16:43:16,852 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:16,907 INFO L614 ElimStorePlain]: treesize reduction 22, result has 67.6 percent of original size [2019-12-07 16:43:16,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:16,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:43:16,908 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:46 [2019-12-07 16:43:16,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:16,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,085 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 16:43:17,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:17,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:17,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 24 [2019-12-07 16:43:17,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:17,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:17,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:17,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:17,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 21 treesize of output 26 [2019-12-07 16:43:17,125 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:17,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:17,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:17,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:17,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 47 [2019-12-07 16:43:17,232 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:17,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:17,249 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:17,249 INFO L377 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 [2019-12-07 16:43:17,249 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:17,379 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 16:43:17,379 INFO L614 ElimStorePlain]: treesize reduction 4, result has 96.2 percent of original size [2019-12-07 16:43:17,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 16:43:17,380 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:124, output treesize:101 [2019-12-07 16:43:17,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:17,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:17,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 64 [2019-12-07 16:43:17,524 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:17,645 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-12-07 16:43:17,646 INFO L614 ElimStorePlain]: treesize reduction 20, result has 76.7 percent of original size [2019-12-07 16:43:17,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,648 INFO L534 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. [2019-12-07 16:43:17,648 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:66 [2019-12-07 16:43:17,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:17,781 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:43:17,781 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:43:17,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:17,825 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:43:17,825 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:43:17,825 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:17,865 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:43:17,865 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:43:17,865 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:18,206 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-12-07 16:43:18,207 INFO L614 ElimStorePlain]: treesize reduction 100, result has 59.8 percent of original size [2019-12-07 16:43:18,235 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:43:18,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:43:18,236 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:18,260 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:43:18,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:43:18,260 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:18,352 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:18,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-12-07 16:43:18,354 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:265, output treesize:137 [2019-12-07 16:43:18,532 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 16:43:18,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:18,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:18,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:18,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:18,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:18,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:18,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:18,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:18,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:18,558 INFO L430 ElimStorePlain]: Different costs {1=[v_prenex_25, v_prenex_16, v_prenex_30, |v_#valid_410|], 10=[v_prenex_33, |v_#length_297|]} [2019-12-07 16:43:18,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:18,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 16:43:18,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:20,417 WARN L192 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 206 DAG size of output: 107 [2019-12-07 16:43:20,417 INFO L614 ElimStorePlain]: treesize reduction 280, result has 41.5 percent of original size [2019-12-07 16:43:20,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:20,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 16:43:20,462 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:20,814 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 16:43:20,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:20,815 INFO L502 ElimStorePlain]: Eliminatee v_prenex_30 vanished before elimination [2019-12-07 16:43:20,815 INFO L502 ElimStorePlain]: Eliminatee |v_#valid_410| vanished before elimination [2019-12-07 16:43:20,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:20,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:20,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:20,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 104 [2019-12-07 16:43:20,960 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:21,852 WARN L192 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2019-12-07 16:43:21,853 INFO L614 ElimStorePlain]: treesize reduction 54, result has 78.6 percent of original size [2019-12-07 16:43:21,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:21,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:22,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:22,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 104 [2019-12-07 16:43:22,006 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:22,719 WARN L192 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2019-12-07 16:43:22,719 INFO L614 ElimStorePlain]: treesize reduction 54, result has 79.0 percent of original size [2019-12-07 16:43:22,721 INFO L502 ElimStorePlain]: Eliminatee v_prenex_28 vanished before elimination [2019-12-07 16:43:22,721 INFO L502 ElimStorePlain]: Eliminatee v_prenex_26 vanished before elimination [2019-12-07 16:43:22,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:22,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 16:43:22,782 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:23,104 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 16:43:23,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:23,163 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:23,163 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:43:23,163 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:23,440 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 16:43:23,440 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:23,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:23,481 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:43:23,481 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:23,724 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 16:43:23,725 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:23,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:23,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:43:23,772 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:23,999 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 16:43:24,000 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:24,000 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2019-12-07 16:43:24,000 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 16:43:24,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:24,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:24,002 INFO L534 ElimStorePlain]: Start of recursive call 1: 26 dim-0 vars, 6 dim-1 vars, 8 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-12-07 16:43:24,003 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 40 variables, input treesize:485, output treesize:135 [2019-12-07 16:43:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:27,156 WARN L192 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-12-07 16:43:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:27,157 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:43:27,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:27,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:27,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:27,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:43:27,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:27,605 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 16:43:27,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:27,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:27,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2019-12-07 16:43:27,630 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:27,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:27,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2019-12-07 16:43:27,650 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:27,986 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 16:43:27,986 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:28,012 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:28,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:43:28,013 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:28,327 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 16:43:28,328 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:28,366 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:28,366 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2019-12-07 16:43:28,367 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:28,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:28,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2019-12-07 16:43:28,405 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:28,716 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 16:43:28,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:28,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2019-12-07 16:43:28,717 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:428, output treesize:338 [2019-12-07 16:43:29,207 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 16:43:30,218 WARN L192 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2019-12-07 16:43:30,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 16:43:31,105 WARN L192 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 16:43:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 16:43:31,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-12-07 16:43:31,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:31,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2019-12-07 16:43:31,229 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:31,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:43:31,282 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:31,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-12-07 16:43:31,330 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:31,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:43:31,376 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:31,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2019-12-07 16:43:31,438 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:32,138 WARN L192 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-12-07 16:43:32,138 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:32,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:43:32,181 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:32,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-12-07 16:43:32,244 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:32,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2019-12-07 16:43:32,277 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:32,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:43:32,345 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:32,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-12-07 16:43:32,430 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:32,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2019-12-07 16:43:32,463 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:33,042 WARN L192 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 16:43:33,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:33,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 2 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2019-12-07 16:43:33,043 INFO L239 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:492, output treesize:300 [2019-12-07 16:43:34,683 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 139 [2019-12-07 16:43:36,349 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 139 [2019-12-07 16:43:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:36,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118092493] [2019-12-07 16:43:36,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:36,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2019-12-07 16:43:36,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750968070] [2019-12-07 16:43:36,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:43:36,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:43:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:43:36,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:43:36,352 INFO L87 Difference]: Start difference. First operand 115 states and 195 transitions. Second operand 14 states. [2019-12-07 16:43:36,784 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-07 16:43:38,119 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-12-07 16:43:42,749 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-12-07 16:43:47,974 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 148 DAG size of output: 133 [2019-12-07 16:43:50,972 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2019-12-07 16:44:02,900 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-12-07 16:44:14,143 WARN L192 SmtUtils]: Spent 7.93 s on a formula simplification. DAG size of input: 294 DAG size of output: 184 [2019-12-07 16:44:17,584 WARN L192 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 152 DAG size of output: 100 [2019-12-07 16:44:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:28,345 INFO L93 Difference]: Finished difference Result 271 states and 461 transitions. [2019-12-07 16:44:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:44:28,348 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-12-07 16:44:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:28,349 INFO L225 Difference]: With dead ends: 271 [2019-12-07 16:44:28,349 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 16:44:28,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=191, Invalid=310, Unknown=5, NotChecked=0, Total=506 [2019-12-07 16:44:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 16:44:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 104. [2019-12-07 16:44:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 16:44:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 173 transitions. [2019-12-07 16:44:28,353 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 173 transitions. Word has length 7 [2019-12-07 16:44:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:28,354 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 173 transitions. [2019-12-07 16:44:28,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:44:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 173 transitions. [2019-12-07 16:44:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 16:44:28,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:28,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:28,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 16:44:28,556 INFO L410 AbstractCegarLoop]: === Iteration 9 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:44:28,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:28,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2128235513, now seen corresponding path program 1 times [2019-12-07 16:44:28,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:44:28,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76436763] [2019-12-07 16:44:28,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 16:44:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:28,691 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 16:44:28,692 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:28,745 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:44:28,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:44:28,746 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:28,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:28,779 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:44:28,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:44:28,779 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:28,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:28,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:28,791 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-12-07 16:44:28,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:28,829 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_301|], 6=[|v_#valid_414|]} [2019-12-07 16:44:28,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-12-07 16:44:28,835 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:28,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:28,972 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 16:44:28,972 INFO L377 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 5 case distinctions, treesize of input 24 treesize of output 71 [2019-12-07 16:44:28,972 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:29,116 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-12-07 16:44:29,116 INFO L614 ElimStorePlain]: treesize reduction 28, result has 72.3 percent of original size [2019-12-07 16:44:29,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:29,134 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:44:29,135 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:29,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:29,193 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:29,193 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 16:44:29,193 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:29,225 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:29,227 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:29,227 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:75, output treesize:31 [2019-12-07 16:44:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:29,262 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:44:29,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:29,280 INFO L430 ElimStorePlain]: Different costs {0=[|#length|], 1=[v_prenex_57]} [2019-12-07 16:44:29,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 16:44:29,288 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:29,460 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 16:44:29,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:29,488 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:29,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2019-12-07 16:44:29,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:29,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:29,489 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:29,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:29,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2019-12-07 16:44:29,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:29,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:29,509 INFO L534 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:29,695 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 16:44:29,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:29,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:29,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:29,696 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-12-07 16:44:29,697 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:213, output treesize:219 [2019-12-07 16:44:29,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:29,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:30,203 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2019-12-07 16:44:30,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:30,208 INFO L430 ElimStorePlain]: Different costs {3=[v_prenex_58, v_prenex_60], 7=[|#valid|]} [2019-12-07 16:44:30,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:30,245 INFO L377 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 3 case distinctions, treesize of input 32 treesize of output 52 [2019-12-07 16:44:30,245 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:30,248 INFO L614 ElimStorePlain]: treesize reduction 107, result has 0.9 percent of original size [2019-12-07 16:44:30,248 INFO L502 ElimStorePlain]: Eliminatee v_prenex_60 vanished before elimination [2019-12-07 16:44:30,248 INFO L502 ElimStorePlain]: Eliminatee |#valid| vanished before elimination [2019-12-07 16:44:30,248 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:30,249 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:1 [2019-12-07 16:44:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:30,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76436763] [2019-12-07 16:44:30,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:30,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 9 [2019-12-07 16:44:30,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399514661] [2019-12-07 16:44:30,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:44:30,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:44:30,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:44:30,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:44:30,250 INFO L87 Difference]: Start difference. First operand 104 states and 173 transitions. Second operand 10 states. [2019-12-07 16:44:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:37,858 INFO L93 Difference]: Finished difference Result 199 states and 349 transitions. [2019-12-07 16:44:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:44:37,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-12-07 16:44:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:37,860 INFO L225 Difference]: With dead ends: 199 [2019-12-07 16:44:37,860 INFO L226 Difference]: Without dead ends: 199 [2019-12-07 16:44:37,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:44:37,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-12-07 16:44:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 102. [2019-12-07 16:44:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 16:44:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 170 transitions. [2019-12-07 16:44:37,864 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 170 transitions. Word has length 7 [2019-12-07 16:44:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:37,864 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 170 transitions. [2019-12-07 16:44:37,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:44:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 170 transitions. [2019-12-07 16:44:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 16:44:37,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:37,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:38,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 16:44:38,065 INFO L410 AbstractCegarLoop]: === Iteration 10 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:44:38,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:38,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2128235512, now seen corresponding path program 1 times [2019-12-07 16:44:38,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:44:38,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219378049] [2019-12-07 16:44:38,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 16:44:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:38,205 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 16:44:38,206 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:38,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:44:38,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:38,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:38,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:38,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2019-12-07 16:44:38,285 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:44:38,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:44:38,285 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:38,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:38,332 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:44:38,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:44:38,332 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:38,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:38,357 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:38,357 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:55 [2019-12-07 16:44:38,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:38,415 INFO L430 ElimStorePlain]: Different costs {3=[|v_#valid_416|, |#valid|], 6=[|v_#length_304|]} [2019-12-07 16:44:38,447 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:38,448 INFO L377 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 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 16:44:38,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:38,637 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-07 16:44:38,638 INFO L614 ElimStorePlain]: treesize reduction 129, result has 39.2 percent of original size [2019-12-07 16:44:38,638 INFO L502 ElimStorePlain]: Eliminatee |#valid| vanished before elimination [2019-12-07 16:44:38,683 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:38,683 INFO L377 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 4 case distinctions, treesize of input 28 treesize of output 74 [2019-12-07 16:44:38,684 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:38,841 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-12-07 16:44:38,841 INFO L614 ElimStorePlain]: treesize reduction 46, result has 63.5 percent of original size [2019-12-07 16:44:38,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:38,861 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 16:44:38,861 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:38,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:38,933 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:38,934 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:44:38,934 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:38,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:38,984 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:38,984 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:221, output treesize:48 [2019-12-07 16:44:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:39,412 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:44:39,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:39,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:39,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:40,067 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 16:44:40,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 16:44:40,129 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:40,130 INFO L377 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 27 treesize of output 49 [2019-12-07 16:44:40,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:40,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:40,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:40,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:40,177 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2019-12-07 16:44:40,178 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:40,228 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:40,228 INFO L377 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 3 case distinctions, treesize of input 27 treesize of output 49 [2019-12-07 16:44:40,228 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:40,272 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:40,272 INFO L377 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 3 case distinctions, treesize of input 21 treesize of output 39 [2019-12-07 16:44:40,272 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:40,487 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 16:44:40,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:40,487 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-12-07 16:44:40,488 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:334, output treesize:192 [2019-12-07 16:44:41,115 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-07 16:44:41,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:41,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2019-12-07 16:44:41,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,156 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:41,577 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-12-07 16:44:41,577 INFO L614 ElimStorePlain]: treesize reduction 11, result has 92.5 percent of original size [2019-12-07 16:44:41,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:41,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 73 [2019-12-07 16:44:41,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:41,622 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:42,129 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-12-07 16:44:42,130 INFO L614 ElimStorePlain]: treesize reduction 11, result has 93.8 percent of original size [2019-12-07 16:44:42,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 15 dim-0 vars, and 2 xjuncts. [2019-12-07 16:44:42,145 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:116, output treesize:216 [2019-12-07 16:44:42,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,543 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 14 [2019-12-07 16:44:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:42,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219378049] [2019-12-07 16:44:42,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:42,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 11 [2019-12-07 16:44:42,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495801015] [2019-12-07 16:44:42,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:44:42,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:44:42,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:44:42,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:44:42,546 INFO L87 Difference]: Start difference. First operand 102 states and 170 transitions. Second operand 12 states. [2019-12-07 16:44:43,508 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-12-07 16:44:46,160 WARN L192 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-07 16:44:46,703 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 16:44:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:47,873 INFO L93 Difference]: Finished difference Result 104 states and 173 transitions. [2019-12-07 16:44:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:44:47,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-12-07 16:44:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:47,875 INFO L225 Difference]: With dead ends: 104 [2019-12-07 16:44:47,875 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 16:44:47,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:44:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 16:44:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2019-12-07 16:44:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 16:44:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 167 transitions. [2019-12-07 16:44:47,878 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 167 transitions. Word has length 7 [2019-12-07 16:44:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:47,878 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 167 transitions. [2019-12-07 16:44:47,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:44:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 167 transitions. [2019-12-07 16:44:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 16:44:47,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:47,879 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:48,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 16:44:48,080 INFO L410 AbstractCegarLoop]: === Iteration 11 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:44:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:48,080 INFO L82 PathProgramCache]: Analyzing trace with hash 40674697, now seen corresponding path program 1 times [2019-12-07 16:44:48,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:44:48,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157578534] [2019-12-07 16:44:48,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 16:44:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:48,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 16:44:48,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:48,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:44:48,267 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,280 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,280 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2019-12-07 16:44:48,324 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:44:48,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:44:48,325 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,373 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:44:48,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:44:48,373 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,393 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:54 [2019-12-07 16:44:48,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:48,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:48,444 INFO L377 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 21 treesize of output 21 [2019-12-07 16:44:48,445 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,520 INFO L614 ElimStorePlain]: treesize reduction 17, result has 81.1 percent of original size [2019-12-07 16:44:48,530 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:44:48,531 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,563 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 16:44:48,579 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,608 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:44:48,621 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,641 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:48,641 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:91, output treesize:33 [2019-12-07 16:44:48,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:44:48,689 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,712 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:44:48,716 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,735 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:48,736 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:39 [2019-12-07 16:44:48,811 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:48,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 68 [2019-12-07 16:44:48,812 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:48,869 INFO L614 ElimStorePlain]: treesize reduction 40, result has 51.2 percent of original size [2019-12-07 16:44:48,869 INFO L534 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. [2019-12-07 16:44:48,869 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2019-12-07 16:44:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:48,922 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:44:49,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2019-12-07 16:44:49,124 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:49,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:49,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2019-12-07 16:44:49,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:49,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:49,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:49,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:49,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:49,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:49,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:49,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:49,211 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:49,391 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-07 16:44:49,392 INFO L614 ElimStorePlain]: treesize reduction 56, result has 55.6 percent of original size [2019-12-07 16:44:49,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-12-07 16:44:49,408 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-12-07 16:44:49,471 INFO L614 ElimStorePlain]: treesize reduction 28, result has 46.2 percent of original size [2019-12-07 16:44:49,471 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2019-12-07 16:44:49,471 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:66, output treesize:24 [2019-12-07 16:44:49,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 16:44:49,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:52,343 WARN L192 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2019-12-07 16:44:52,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-12-07 16:44:52,379 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:44:52,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:44:52,411 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:44:52,442 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-12-07 16:44:52,478 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,517 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-12-07 16:44:52,517 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,542 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-12-07 16:44:52,542 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-12-07 16:44:52,573 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:44:52,610 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-12-07 16:44:52,637 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-12-07 16:44:52,678 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,703 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-12-07 16:44:52,704 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:52,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:52,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-12-07 16:44:52,736 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:53,400 WARN L192 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 16:44:53,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:53,402 INFO L534 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 12 xjuncts. [2019-12-07 16:44:53,402 INFO L239 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:935, output treesize:651 [2019-12-07 16:44:54,801 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 97 DAG size of output: 64 [2019-12-07 16:44:54,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:54,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:54,807 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:54,807 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:1 [2019-12-07 16:44:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:54,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157578534] [2019-12-07 16:44:54,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1843330668] [2019-12-07 16:44:54,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:44:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:55,006 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 16:44:55,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:55,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:44:55,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:55,277 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:55,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:44:55,281 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:55,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:55,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:55,297 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-12-07 16:44:55,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:55,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 16:44:55,399 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:55,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:55,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-12-07 16:44:55,418 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:55,433 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:55,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:55,433 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-12-07 16:44:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:55,523 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:44:55,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:55,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-12-07 16:44:55,741 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 16:44:55,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:55,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2019-12-07 16:44:55,799 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:55,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:55,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2019-12-07 16:44:55,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:55,907 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:56,123 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 16:44:56,124 INFO L614 ElimStorePlain]: treesize reduction 56, result has 54.1 percent of original size [2019-12-07 16:44:56,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:56,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 16:44:56,125 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2019-12-07 16:44:56,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:56,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,449 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-07 16:44:56,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:56,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:56,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:56,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:56,454 INFO L430 ElimStorePlain]: Different costs {3=[|#valid|], 5=[|#length|]} [2019-12-07 16:44:56,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:56,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:56,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:44:56,487 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:56,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:56,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:56,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:44:56,518 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:56,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:56,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:44:56,544 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:56,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:56,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:44:56,566 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:56,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:56,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:44:56,583 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:56,647 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:56,661 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2019-12-07 16:44:56,661 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:56,687 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:56,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-12-07 16:44:56,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,689 INFO L534 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:56,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:56,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-12-07 16:44:56,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,710 INFO L534 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:56,839 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 16:44:56,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:56,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:56,849 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-12-07 16:44:56,849 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:177, output treesize:95 [2019-12-07 16:44:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:57,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581618142] [2019-12-07 16:44:57,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:57,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 16:44:57,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:57,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:44:57,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:57,715 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:57,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:44:57,718 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:57,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:57,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:57,731 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:26 [2019-12-07 16:44:57,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:57,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 16:44:57,840 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:57,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:57,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-12-07 16:44:57,859 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:57,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:57,872 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:57,872 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-12-07 16:44:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:58,003 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:44:58,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-12-07 16:44:58,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 16:44:58,281 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:58,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2019-12-07 16:44:58,291 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:58,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:58,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2019-12-07 16:44:58,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:58,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:58,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,393 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:58,592 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 16:44:58,592 INFO L614 ElimStorePlain]: treesize reduction 56, result has 54.1 percent of original size [2019-12-07 16:44:58,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:58,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 16:44:58,594 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2019-12-07 16:44:58,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:58,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:58,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:58,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:58,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:58,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:58,855 INFO L430 ElimStorePlain]: Different costs {3=[|#valid|], 5=[|#length|]} [2019-12-07 16:44:58,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:58,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:58,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:44:58,889 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:58,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:58,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:58,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:44:58,914 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:58,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:58,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:44:58,939 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:58,960 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:58,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:44:58,960 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:58,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:58,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:44:58,982 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:59,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:59,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2019-12-07 16:44:59,074 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:59,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:59,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-12-07 16:44:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,106 INFO L534 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:59,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:59,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-12-07 16:44:59,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,133 INFO L534 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:59,265 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 16:44:59,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:59,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:59,273 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-12-07 16:44:59,274 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:177, output treesize:95 [2019-12-07 16:44:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:59,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:44:59,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7, 6, 6, 6] total 29 [2019-12-07 16:44:59,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717152051] [2019-12-07 16:44:59,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 16:44:59,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:44:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 16:44:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2019-12-07 16:44:59,560 INFO L87 Difference]: Start difference. First operand 100 states and 167 transitions. Second operand 30 states. [2019-12-07 16:45:00,635 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-12-07 16:45:01,261 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 67 [2019-12-07 16:45:02,059 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2019-12-07 16:45:02,825 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 66 [2019-12-07 16:45:03,964 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-12-07 16:45:04,842 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2019-12-07 16:45:05,703 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-12-07 16:45:06,670 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 43 [2019-12-07 16:45:07,252 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2019-12-07 16:45:08,040 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-12-07 16:45:08,549 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2019-12-07 16:45:09,502 WARN L192 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-12-07 16:45:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:09,809 INFO L93 Difference]: Finished difference Result 250 states and 421 transitions. [2019-12-07 16:45:09,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 16:45:09,810 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 10 [2019-12-07 16:45:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:09,811 INFO L225 Difference]: With dead ends: 250 [2019-12-07 16:45:09,812 INFO L226 Difference]: Without dead ends: 250 [2019-12-07 16:45:09,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=450, Invalid=1620, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 16:45:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-07 16:45:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 92. [2019-12-07 16:45:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 16:45:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 155 transitions. [2019-12-07 16:45:09,815 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 155 transitions. Word has length 10 [2019-12-07 16:45:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:09,815 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 155 transitions. [2019-12-07 16:45:09,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 16:45:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 155 transitions. [2019-12-07 16:45:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 16:45:09,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:45:09,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:45:10,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 16:45:10,417 INFO L410 AbstractCegarLoop]: === Iteration 12 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:45:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:45:10,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1263078371, now seen corresponding path program 1 times [2019-12-07 16:45:10,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:45:10,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554816100] [2019-12-07 16:45:10,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 16:45:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:10,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 16:45:10,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:45:10,562 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 16:45:10,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 16:45:10,562 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:10,588 INFO L614 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2019-12-07 16:45:10,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:45:10,589 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:10,589 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:29 [2019-12-07 16:45:10,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:45:10,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:10,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-12-07 16:45:10,625 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:10,646 INFO L614 ElimStorePlain]: treesize reduction 14, result has 64.1 percent of original size [2019-12-07 16:45:10,646 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:10,646 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:25 [2019-12-07 16:45:10,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:10,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 62 [2019-12-07 16:45:10,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:10,721 INFO L614 ElimStorePlain]: treesize reduction 28, result has 51.7 percent of original size [2019-12-07 16:45:10,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:10,722 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:30 [2019-12-07 16:45:10,762 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:45:10,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:45:10,762 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:10,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:10,801 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:45:10,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:45:10,801 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:10,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:10,817 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:10,818 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:58 [2019-12-07 16:45:10,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:10,859 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_322|], 1=[|#length|], 10=[|v_#valid_435|]} [2019-12-07 16:45:10,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-12-07 16:45:10,867 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:11,041 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-12-07 16:45:11,041 INFO L614 ElimStorePlain]: treesize reduction 130, result has 39.3 percent of original size [2019-12-07 16:45:11,041 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 16:45:11,167 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-07 16:45:11,167 INFO L343 Elim1Store]: treesize reduction 24, result has 77.4 percent of original size [2019-12-07 16:45:11,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 31 treesize of output 103 [2019-12-07 16:45:11,168 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:11,343 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-12-07 16:45:11,343 INFO L614 ElimStorePlain]: treesize reduction 42, result has 67.2 percent of original size [2019-12-07 16:45:11,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:11,367 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:45:11,367 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:11,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:11,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:11,452 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:45:11,452 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:11,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:11,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:11,506 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:216, output treesize:40 [2019-12-07 16:45:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:12,120 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:45:12,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:12,187 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_107], 1=[|#length|]} [2019-12-07 16:45:12,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 16:45:12,193 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:12,523 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-12-07 16:45:12,523 INFO L614 ElimStorePlain]: treesize reduction 21, result has 92.0 percent of original size [2019-12-07 16:45:12,555 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:12,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2019-12-07 16:45:12,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:12,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:12,556 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:12,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:12,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2019-12-07 16:45:12,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:12,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:12,579 INFO L534 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:12,786 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-07 16:45:12,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:12,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:12,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:12,788 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-12-07 16:45:12,788 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:263, output treesize:248 [2019-12-07 16:45:12,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:12,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:13,287 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-12-07 16:45:13,471 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 16:45:13,684 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 16:45:13,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:45:13,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:45:13,702 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:13,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-12-07 16:45:13,710 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:13,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2019-12-07 16:45:13,718 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:13,921 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-12-07 16:45:13,921 INFO L614 ElimStorePlain]: treesize reduction 39, result has 81.1 percent of original size [2019-12-07 16:45:13,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 16:45:13,941 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:13,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-07 16:45:13,965 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:13,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:45:13,976 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:14,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:14,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-12-07 16:45:14,051 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:246, output treesize:119 [2019-12-07 16:45:14,511 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 16:45:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:14,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554816100] [2019-12-07 16:45:14,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:45:14,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 16 [2019-12-07 16:45:14,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169629918] [2019-12-07 16:45:14,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 16:45:14,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:45:14,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 16:45:14,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:45:14,514 INFO L87 Difference]: Start difference. First operand 92 states and 155 transitions. Second operand 18 states. [2019-12-07 16:45:15,623 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 16:45:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:24,504 INFO L93 Difference]: Finished difference Result 175 states and 285 transitions. [2019-12-07 16:45:24,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:45:24,504 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 12 [2019-12-07 16:45:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:24,505 INFO L225 Difference]: With dead ends: 175 [2019-12-07 16:45:24,505 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 16:45:24,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=249, Invalid=401, Unknown=0, NotChecked=0, Total=650 [2019-12-07 16:45:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 16:45:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 90. [2019-12-07 16:45:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 16:45:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 154 transitions. [2019-12-07 16:45:24,508 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 154 transitions. Word has length 12 [2019-12-07 16:45:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:24,508 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 154 transitions. [2019-12-07 16:45:24,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 16:45:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 154 transitions. [2019-12-07 16:45:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 16:45:24,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:45:24,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:45:24,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 16:45:24,710 INFO L410 AbstractCegarLoop]: === Iteration 13 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:45:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:45:24,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1263078372, now seen corresponding path program 1 times [2019-12-07 16:45:24,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:45:24,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775254844] [2019-12-07 16:45:24,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 16:45:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:24,838 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 16:45:24,839 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:45:24,875 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 16:45:24,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 16:45:24,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:24,924 INFO L614 ElimStorePlain]: treesize reduction 10, result has 80.4 percent of original size [2019-12-07 16:45:24,937 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 16:45:24,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 16:45:24,938 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:24,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:24,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:45:24,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:24,958 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:42 [2019-12-07 16:45:24,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:45:24,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:45:25,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:25,098 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:25,099 INFO L377 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 18 treesize of output 36 [2019-12-07 16:45:25,099 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:25,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:45:25,109 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,152 INFO L614 ElimStorePlain]: treesize reduction 45, result has 42.3 percent of original size [2019-12-07 16:45:25,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 16:45:25,156 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:25,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,168 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:95, output treesize:34 [2019-12-07 16:45:25,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:25,219 INFO L377 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 21 treesize of output 54 [2019-12-07 16:45:25,220 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,268 INFO L614 ElimStorePlain]: treesize reduction 20, result has 69.2 percent of original size [2019-12-07 16:45:25,268 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,268 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:45 [2019-12-07 16:45:25,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:25,343 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 16:45:25,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:45:25,344 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:45:25,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 18 [2019-12-07 16:45:25,362 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:45:25,369 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,733 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-07 16:45:25,734 INFO L614 ElimStorePlain]: treesize reduction 8, result has 96.1 percent of original size [2019-12-07 16:45:25,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:45:25,744 INFO L377 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 18 [2019-12-07 16:45:25,745 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:45:25,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:45:25,754 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,772 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 16:45:25,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 16:45:25,772 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:25,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:25,860 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-12-07 16:45:25,860 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:220, output treesize:176 [2019-12-07 16:45:26,017 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-12-07 16:45:26,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:26,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:26,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:26,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:26,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:26,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:26,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:26,028 INFO L430 ElimStorePlain]: Different costs {1=[v_prenex_127, v_prenex_120, |v_#valid_441|], 3=[v_prenex_126, |v_#length_329|]} [2019-12-07 16:45:26,033 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:45:26,033 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:26,359 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-12-07 16:45:26,360 INFO L614 ElimStorePlain]: treesize reduction 21, result has 87.8 percent of original size [2019-12-07 16:45:26,384 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:26,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 16:45:26,384 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:26,533 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-07 16:45:26,534 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:26,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:26,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:45:26,558 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:26,708 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 16:45:26,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:26,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:26,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 49 [2019-12-07 16:45:26,772 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:27,157 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-12-07 16:45:27,157 INFO L614 ElimStorePlain]: treesize reduction 20, result has 87.7 percent of original size [2019-12-07 16:45:27,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:27,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 53 [2019-12-07 16:45:27,214 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:27,590 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-12-07 16:45:27,590 INFO L614 ElimStorePlain]: treesize reduction 20, result has 87.7 percent of original size [2019-12-07 16:45:27,592 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[v_prenex_125, v_prenex_117, v_prenex_123, v_prenex_118]} [2019-12-07 16:45:27,606 INFO L377 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 7 treesize of output 3 [2019-12-07 16:45:27,606 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:27,751 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 16:45:27,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:27,765 INFO L377 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 7 treesize of output 3 [2019-12-07 16:45:27,765 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:27,912 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 16:45:27,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:27,913 INFO L502 ElimStorePlain]: Eliminatee v_prenex_125 vanished before elimination [2019-12-07 16:45:27,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:45:27,931 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 16:45:27,931 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,070 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 16:45:28,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:28,070 INFO L502 ElimStorePlain]: Eliminatee v_prenex_123 vanished before elimination [2019-12-07 16:45:28,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:45:28,085 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:45:28,085 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,216 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 16:45:28,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:28,218 INFO L534 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 5 dim-1 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-12-07 16:45:28,218 INFO L239 ElimStorePlain]: Needed 10 recursive calls to eliminate 23 variables, input treesize:293, output treesize:97 [2019-12-07 16:45:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:28,675 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-07 16:45:28,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:28,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:28,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:28,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:31,527 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-12-07 16:45:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:33,836 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:45:33,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:33,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:34,537 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-12-07 16:45:34,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 16:45:34,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:34,568 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2019-12-07 16:45:34,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:34,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:34,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2019-12-07 16:45:34,605 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:34,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:34,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:45:34,633 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:34,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:34,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 16:45:34,661 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:34,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:34,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2019-12-07 16:45:34,692 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:34,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:34,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2019-12-07 16:45:34,717 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:35,032 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 16:45:35,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:35,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-12-07 16:45:35,033 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:488, output treesize:338 [2019-12-07 16:45:36,052 WARN L192 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2019-12-07 16:45:36,645 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-12-07 16:45:36,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:45:36,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:45:36,678 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:36,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-12-07 16:45:36,700 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:36,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-12-07 16:45:36,730 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:36,904 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 16:45:36,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:36,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2019-12-07 16:45:36,932 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:36,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2019-12-07 16:45:36,961 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:36,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:45:36,987 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:37,113 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 16:45:37,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:37,114 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-12-07 16:45:37,114 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:206, output treesize:118 [2019-12-07 16:45:37,567 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 16:45:38,096 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 16:45:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:38,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775254844] [2019-12-07 16:45:38,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:45:38,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 13 [2019-12-07 16:45:38,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744382767] [2019-12-07 16:45:38,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:45:38,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:45:38,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:45:38,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=139, Unknown=1, NotChecked=0, Total=210 [2019-12-07 16:45:38,100 INFO L87 Difference]: Start difference. First operand 90 states and 154 transitions. Second operand 15 states. [2019-12-07 16:45:38,467 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-12-07 16:45:38,649 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-12-07 16:45:38,905 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-12-07 16:45:39,936 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 67 [2019-12-07 16:45:41,780 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2019-12-07 16:45:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:45,340 INFO L93 Difference]: Finished difference Result 89 states and 137 transitions. [2019-12-07 16:45:45,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:45:45,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2019-12-07 16:45:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:45,343 INFO L225 Difference]: With dead ends: 89 [2019-12-07 16:45:45,343 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 16:45:45,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=146, Invalid=273, Unknown=1, NotChecked=0, Total=420 [2019-12-07 16:45:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 16:45:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-12-07 16:45:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 16:45:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2019-12-07 16:45:45,345 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 12 [2019-12-07 16:45:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:45,345 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2019-12-07 16:45:45,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:45:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2019-12-07 16:45:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:45:45,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:45:45,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:45:45,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 16:45:45,546 INFO L410 AbstractCegarLoop]: === Iteration 14 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:45:45,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:45:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1657418501, now seen corresponding path program 1 times [2019-12-07 16:45:45,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:45:45,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382996628] [2019-12-07 16:45:45,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 16:45:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:45,630 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:45:45,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:45:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:45,643 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:45:45,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2019-12-07 16:45:45,653 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:45,733 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:45,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-12-07 16:45:45,743 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:45,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:45,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 16:45:45,833 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:45,925 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:45,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2019-12-07 16:45:45,934 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:46,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:46,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2019-12-07 16:45:46,018 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:46,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:46,110 INFO L377 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 10 treesize of output 4 [2019-12-07 16:45:46,110 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:46,181 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:46,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2019-12-07 16:45:46,189 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:46,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:46,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2019-12-07 16:45:46,281 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:46,355 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:46,357 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 16:45:46,357 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:105, output treesize:49 [2019-12-07 16:45:46,489 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-12-07 16:45:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:46,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382996628] [2019-12-07 16:45:46,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:45:46,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2019-12-07 16:45:46,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126183292] [2019-12-07 16:45:46,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:45:46,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:45:46,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:45:46,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:45:46,564 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand 6 states. [2019-12-07 16:45:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:46,601 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions. [2019-12-07 16:45:46,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:45:46,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 16:45:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:46,602 INFO L225 Difference]: With dead ends: 48 [2019-12-07 16:45:46,602 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 16:45:46,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:45:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 16:45:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 16:45:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 16:45:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 75 transitions. [2019-12-07 16:45:46,604 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 75 transitions. Word has length 14 [2019-12-07 16:45:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:46,604 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 75 transitions. [2019-12-07 16:45:46,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:45:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 75 transitions. [2019-12-07 16:45:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:45:46,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:45:46,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:45:46,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 16:45:46,805 INFO L410 AbstractCegarLoop]: === Iteration 15 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:45:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:45:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash 159632114, now seen corresponding path program 1 times [2019-12-07 16:45:46,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:45:46,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522055776] [2019-12-07 16:45:46,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 16:45:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:46,920 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:45:46,921 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:45:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:46,934 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:45:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:46,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522055776] [2019-12-07 16:45:46,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:45:46,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:45:46,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447884931] [2019-12-07 16:45:46,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:45:46,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:45:46,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:45:46,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:45:46,943 INFO L87 Difference]: Start difference. First operand 48 states and 75 transitions. Second operand 5 states. [2019-12-07 16:45:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:46,966 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-12-07 16:45:46,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:45:46,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 16:45:46,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:46,967 INFO L225 Difference]: With dead ends: 28 [2019-12-07 16:45:46,968 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 16:45:46,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:45:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 16:45:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 16:45:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 16:45:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-12-07 16:45:46,969 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 15 [2019-12-07 16:45:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:46,969 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-12-07 16:45:46,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:45:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2019-12-07 16:45:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:45:46,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:45:46,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:45:47,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 16:45:47,171 INFO L410 AbstractCegarLoop]: === Iteration 16 === [deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr3REQUIRES_VIOLATION, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr0REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, buildErr7REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, deleteErr1REQUIRES_VIOLATION, deleteErr10REQUIRES_VIOLATION, deleteErr11REQUIRES_VIOLATION, deleteErr8ASSERT_VIOLATIONMEMORY_FREE, deleteErr9ASSERT_VIOLATIONMEMORY_FREE, deleteErr0REQUIRES_VIOLATION, deleteErr14ASSERT_VIOLATIONMEMORY_FREE, deleteErr2REQUIRES_VIOLATION, deleteErr12ASSERT_VIOLATIONMEMORY_FREE, deleteErr3REQUIRES_VIOLATION, deleteErr13ASSERT_VIOLATIONMEMORY_FREE, deleteErr6ASSERT_VIOLATIONMEMORY_FREE, deleteErr7ASSERT_VIOLATIONMEMORY_FREE, deleteErr4ASSERT_VIOLATIONMEMORY_FREE, deleteErr5ASSERT_VIOLATIONMEMORY_FREE, buildErr7REQUIRES_VIOLATION, buildErr6REQUIRES_VIOLATION, buildErr5REQUIRES_VIOLATION, buildErr10REQUIRES_VIOLATION, buildErr4REQUIRES_VIOLATION, buildErr11REQUIRES_VIOLATION, buildErr3REQUIRES_VIOLATION, buildErr12REQUIRES_VIOLATION, buildErr2REQUIRES_VIOLATION, buildErr13REQUIRES_VIOLATION, buildErr1REQUIRES_VIOLATION, buildErr0REQUIRES_VIOLATION, buildErr9REQUIRES_VIOLATION, buildErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 16:45:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:45:47,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1110886071, now seen corresponding path program 1 times [2019-12-07 16:45:47,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:45:47,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194811529] [2019-12-07 16:45:47,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c57aa40-2b1f-4cab-aceb-9af72f842af6/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 [2019-12-07 16:45:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:45:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:45:47,632 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 16:45:47,633 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:45:47,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 16:45:47,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [568] [568] ULTIMATE.startENTRY-->L1072-1: Formula: (let ((.cse0 (store |v_#valid_346| (_ bv0 32) (_ bv0 1)))) (let ((.cse5 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_96| (_ bv1 1))) (.cse2 (bvadd |v_ULTIMATE.start_main_~#id1~0.offset_79| (_ bv1 32))) (.cse3 (bvadd |v_ULTIMATE.start_main_~#id1~0.offset_79| (_ bv2 32))) (.cse4 (bvadd |v_ULTIMATE.start_main_~#id1~0.offset_79| (_ bv3 32)))) (and (= (_ bv0 32) |v_#NULL.offset_4|) (= v_ULTIMATE.start_main_~argv.offset_10 |v_ULTIMATE.start_main_#in~argv.offset_12|) (bvult |v_#StackHeapBarrier_84| |v_ULTIMATE.start_main_~#id1~0.base_96|) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_96|)) (= |v_ULTIMATE.start_main_#in~argv.base_12| |v_ULTIMATE.start_#in~argv.base_6|) (= v_ULTIMATE.start_main_~list~2.offset_15 (_ bv0 32)) (= |v_ULTIMATE.start_main_~#id1~0.offset_79| (_ bv0 32)) (= |v_ULTIMATE.start_main_#in~argc_12| v_ULTIMATE.start_main_~argc_10) (= |v_ULTIMATE.start_main_~#id2~0.offset_31| (_ bv0 32)) (= v_currentRoundingMode_6 ~roundNearestTiesToEven) (= |v_ULTIMATE.start_main_old_#valid_18| .cse0) (= |v_#memory_$Pointer$.base_188| (store |v_#memory_$Pointer$.base_189| |v_ULTIMATE.start_main_~#id1~0.base_96| (let ((.cse1 (select |v_#memory_$Pointer$.base_188| |v_ULTIMATE.start_main_~#id1~0.base_96|))) (store (store (store (store (select |v_#memory_$Pointer$.base_189| |v_ULTIMATE.start_main_~#id1~0.base_96|) |v_ULTIMATE.start_main_~#id1~0.offset_79| (select .cse1 |v_ULTIMATE.start_main_~#id1~0.offset_79|)) .cse2 (select .cse1 .cse2)) .cse3 (select .cse1 .cse3)) .cse4 (select .cse1 .cse4))))) (bvult |v_#StackHeapBarrier_84| |v_ULTIMATE.start_main_~#id2~0.base_48|) (= |v_ULTIMATE.start_main_#in~argv.offset_12| |v_ULTIMATE.start_#in~argv.offset_6|) (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_main_~#id2~0.base_48|)) (= |v_#length_244| (store (store |v_#length_245| |v_ULTIMATE.start_main_~#id1~0.base_96| (_ bv4 32)) |v_ULTIMATE.start_main_~#id2~0.base_48| (_ bv4 32))) (= |v_ULTIMATE.start_main_#in~argv.base_12| v_ULTIMATE.start_main_~argv.base_10) (= v_ULTIMATE.start_main_~list~2.base_15 (_ bv0 32)) (= (store .cse5 |v_ULTIMATE.start_main_~#id2~0.base_48| (_ bv1 1)) |v_#valid_344|) (= |v_ULTIMATE.start_main_#in~argc_12| |v_ULTIMATE.start_#in~argc_6|) (bvult (_ bv0 32) |v_#StackHeapBarrier_84|) (= (store |v_#memory_int_152| |v_ULTIMATE.start_main_~#id1~0.base_96| (store (store (store (store (select |v_#memory_int_152| |v_ULTIMATE.start_main_~#id1~0.base_96|) |v_ULTIMATE.start_main_~#id1~0.offset_79| (_ bv0 8)) .cse2 (_ bv0 8)) .cse3 (_ bv0 8)) .cse4 (_ bv0 8))) |v_#memory_int_151|) (= (store |v_#memory_$Pointer$.offset_189| |v_ULTIMATE.start_main_~#id1~0.base_96| (let ((.cse6 (select |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_main_~#id1~0.base_96|))) (store (store (store (store (select |v_#memory_$Pointer$.offset_189| |v_ULTIMATE.start_main_~#id1~0.base_96|) |v_ULTIMATE.start_main_~#id1~0.offset_79| (select .cse6 |v_ULTIMATE.start_main_~#id1~0.offset_79|)) .cse2 (select .cse6 .cse2)) .cse3 (select .cse6 .cse3)) .cse4 (select .cse6 .cse4)))) |v_#memory_$Pointer$.offset_188|) (= |v_#NULL.base_4| (_ bv0 32))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_84|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_189|, #valid=|v_#valid_346|, #memory_int=|v_#memory_int_152|, #length=|v_#length_245|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_6|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_6|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_189|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_6|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_10, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_188|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_96|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_60|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_6|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_10, ULTIMATE.start_main_~list~2.base=v_ULTIMATE.start_main_~list~2.base_15, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_48|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_31|, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_10, #length=|v_#length_244|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_6|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_61|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_6|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_17|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_12|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_12|, ULTIMATE.start_main_old_#valid=|v_ULTIMATE.start_main_old_#valid_18|, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_84|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_344|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_12|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_main_~list~2.offset=v_ULTIMATE.start_main_~list~2.offset_15, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_14|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_79|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_188|, currentRoundingMode=v_currentRoundingMode_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv.offset, #memory_$Pointer$.base, ULTIMATE.start_main_~#id1~0.base, ULTIMATE.start_main_#t~nondet13, #NULL.offset, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~list~2.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_old_#valid, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~list~2.offset, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#id1~0.offset, #memory_$Pointer$.offset, currentRoundingMode] because there is no mapped edge [2019-12-07 16:45:47,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [419] [419] L1072-2-->L1073-1: Formula: (let ((.cse1 (bvadd |v_ULTIMATE.start_main_~#id1~0.offset_9| (_ bv4 32)))) (and (= (let ((.cse0 (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id1~0.base_11|))) (concat (concat (concat (select .cse0 (bvadd |v_ULTIMATE.start_main_~#id1~0.offset_9| (_ bv3 32))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~#id1~0.offset_9| (_ bv2 32)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~#id1~0.offset_9| (_ bv1 32)))) (select .cse0 |v_ULTIMATE.start_main_~#id1~0.offset_9|))) |v_ULTIMATE.start_main_#t~mem14_8|) (bvule .cse1 (select |v_#length_48| |v_ULTIMATE.start_main_~#id1~0.base_11|)) (bvule |v_ULTIMATE.start_main_~#id1~0.offset_9| .cse1) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#id1~0.base_11|) (_ bv1 1)))) InVars {ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_11|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_14|, #length=|v_#length_48|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_9|} OutVars{ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_11|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_3|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_14|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_8|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-12-07 16:45:47,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [486] [486] buildENTRY-->L1049-1: Formula: (and (bvult |v_#StackHeapBarrier_33| |v_buildThread1of1ForFork1_~#list~0.base_7|) (= (store |v_#valid_169| |v_buildThread1of1ForFork1_~#list~0.base_7| (_ bv1 1)) |v_#valid_168|) (= |v_buildThread1of1ForFork1_~#list~0.offset_7| (_ bv0 32)) (= |v_#length_107| (store |v_#length_108| |v_buildThread1of1ForFork1_~#list~0.base_7| (_ bv4 32))) (= (select (select |v_#memory_$Pointer$.offset_70| |v_buildThread1of1ForFork1_~#list~0.base_7|) |v_buildThread1of1ForFork1_~#list~0.offset_7|) v_buildThread1of1ForFork1_~plist.offset_6) (= (select |v_#valid_169| |v_buildThread1of1ForFork1_~#list~0.base_7|) (_ bv0 1)) (= v_buildThread1of1ForFork1_~plist.offset_6 |v_buildThread1of1ForFork1_#in~plist.offset_7|) (= |v_buildThread1of1ForFork1_#in~plist.base_7| v_buildThread1of1ForFork1_~plist.base_6) (= v_buildThread1of1ForFork1_~plist.base_6 (select (select |v_#memory_$Pointer$.base_70| |v_buildThread1of1ForFork1_~#list~0.base_7|) |v_buildThread1of1ForFork1_~#list~0.offset_7|))) InVars {buildThread1of1ForFork1_#in~plist.base=|v_buildThread1of1ForFork1_#in~plist.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_70|, #valid=|v_#valid_169|, #length=|v_#length_108|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_70|, buildThread1of1ForFork1_#in~plist.offset=|v_buildThread1of1ForFork1_#in~plist.offset_7|} OutVars{buildThread1of1ForFork1_#in~plist.base=|v_buildThread1of1ForFork1_#in~plist.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_70|, #valid=|v_#valid_168|, buildThread1of1ForFork1_~plist.offset=v_buildThread1of1ForFork1_~plist.offset_6, #length=|v_#length_107|, buildThread1of1ForFork1_~plist.base=v_buildThread1of1ForFork1_~plist.base_6, buildThread1of1ForFork1_~#list~0.offset=|v_buildThread1of1ForFork1_~#list~0.offset_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_70|, buildThread1of1ForFork1_#in~plist.offset=|v_buildThread1of1ForFork1_#in~plist.offset_7|, buildThread1of1ForFork1_~#list~0.base=|v_buildThread1of1ForFork1_~#list~0.base_7|} AuxVars[] AssignedVars[#valid, buildThread1of1ForFork1_~plist.offset, #length, buildThread1of1ForFork1_~plist.base, buildThread1of1ForFork1_~#list~0.offset, buildThread1of1ForFork1_~#list~0.base] because there is no mapped edge [2019-12-07 16:45:47,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L1049-1-->L1042-1: Formula: (and (= |v_buildThread1of1ForFork1_append_#in~plist.base_13| v_buildThread1of1ForFork1_append_~plist.base_76) (= (select |v_#valid_390| |v_buildThread1of1ForFork1_append_#t~malloc2.base_56|) (_ bv0 1)) (= |v_buildThread1of1ForFork1_append_#in~plist.offset_13| |v_buildThread1of1ForFork1_~#list~0.offset_17|) (= (_ bv0 32) |v_buildThread1of1ForFork1_append_#t~malloc2.offset_56|) (not (= (_ bv0 32) |v_buildThread1of1ForFork1_append_#t~malloc2.base_56|)) (= |v_#length_276| (store |v_#length_277| |v_buildThread1of1ForFork1_append_#t~malloc2.base_56| (_ bv8 32))) (= (store |v_#valid_390| |v_buildThread1of1ForFork1_append_#t~malloc2.base_56| (_ bv1 1)) |v_#valid_389|) (bvult |v_buildThread1of1ForFork1_append_#t~malloc2.base_56| |v_#StackHeapBarrier_98|) (= |v_buildThread1of1ForFork1_append_#in~plist.offset_13| v_buildThread1of1ForFork1_append_~plist.offset_68) (= |v_buildThread1of1ForFork1_append_#in~plist.base_13| |v_buildThread1of1ForFork1_~#list~0.base_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_98|, #valid=|v_#valid_390|, #length=|v_#length_277|, buildThread1of1ForFork1_~#list~0.offset=|v_buildThread1of1ForFork1_~#list~0.offset_17|, buildThread1of1ForFork1_~#list~0.base=|v_buildThread1of1ForFork1_~#list~0.base_17|} OutVars{buildThread1of1ForFork1_append_#t~malloc2.offset=|v_buildThread1of1ForFork1_append_#t~malloc2.offset_56|, buildThread1of1ForFork1_append_#t~mem4.offset=|v_buildThread1of1ForFork1_append_#t~mem4.offset_82|, buildThread1of1ForFork1_append_#t~mem3.base=|v_buildThread1of1ForFork1_append_#t~mem3.base_71|, buildThread1of1ForFork1_append_#in~plist.base=|v_buildThread1of1ForFork1_append_#in~plist.base_13|, buildThread1of1ForFork1_append_~plist.base=v_buildThread1of1ForFork1_append_~plist.base_76, buildThread1of1ForFork1_~#list~0.offset=|v_buildThread1of1ForFork1_~#list~0.offset_17|, buildThread1of1ForFork1_~#list~0.base=|v_buildThread1of1ForFork1_~#list~0.base_17|, buildThread1of1ForFork1_append_#t~mem6.offset=|v_buildThread1of1ForFork1_append_#t~mem6.offset_72|, buildThread1of1ForFork1_append_#t~mem6.base=|v_buildThread1of1ForFork1_append_#t~mem6.base_72|, buildThread1of1ForFork1_append_#t~mem4.base=|v_buildThread1of1ForFork1_append_#t~mem4.base_82|, buildThread1of1ForFork1_append_#t~mem5.base=|v_buildThread1of1ForFork1_append_#t~mem5.base_83|, #length=|v_#length_276|, buildThread1of1ForFork1_append_#t~malloc2.base=|v_buildThread1of1ForFork1_append_#t~malloc2.base_56|, buildThread1of1ForFork1_append_#t~malloc7.base=|v_buildThread1of1ForFork1_append_#t~malloc7.base_56|, buildThread1of1ForFork1_append_#t~ite8.base=|v_buildThread1of1ForFork1_append_#t~ite8.base_70|, buildThread1of1ForFork1_append_~elem~0.offset=v_buildThread1of1ForFork1_append_~elem~0.offset_134, buildThread1of1ForFork1_append_#t~ite8.offset=|v_buildThread1of1ForFork1_append_#t~ite8.offset_70|, buildThread1of1ForFork1_append_#t~malloc7.offset=|v_buildThread1of1ForFork1_append_#t~malloc7.offset_56|, buildThread1of1ForFork1_append_#t~mem3.offset=|v_buildThread1of1ForFork1_append_#t~mem3.offset_71|, #StackHeapBarrier=|v_#StackHeapBarrier_98|, #valid=|v_#valid_389|, buildThread1of1ForFork1_append_~plist.offset=v_buildThread1of1ForFork1_append_~plist.offset_68, buildThread1of1ForFork1_append_#in~plist.offset=|v_buildThread1of1ForFork1_append_#in~plist.offset_13|, buildThread1of1ForFork1_append_~elem~0.base=v_buildThread1of1ForFork1_append_~elem~0.base_140, buildThread1of1ForFork1_append_#t~mem5.offset=|v_buildThread1of1ForFork1_append_#t~mem5.offset_82|} AuxVars[] AssignedVars[buildThread1of1ForFork1_append_#t~malloc2.offset, buildThread1of1ForFork1_append_#t~mem4.offset, buildThread1of1ForFork1_append_#t~mem3.base, buildThread1of1ForFork1_append_#t~ite8.base, buildThread1of1ForFork1_append_#in~plist.base, buildThread1of1ForFork1_append_~elem~0.offset, buildThread1of1ForFork1_append_~plist.base, buildThread1of1ForFork1_append_#t~ite8.offset, buildThread1of1ForFork1_append_#t~malloc7.offset, buildThread1of1ForFork1_append_#t~mem3.offset, buildThread1of1ForFork1_append_#t~mem6.offset, buildThread1of1ForFork1_append_#t~mem6.base, #valid, buildThread1of1ForFork1_append_#t~mem4.base, buildThread1of1ForFork1_append_#t~mem5.base, #length, buildThread1of1ForFork1_append_~plist.offset, buildThread1of1ForFork1_append_#t~malloc2.base, buildThread1of1ForFork1_append_#in~plist.offset, buildThread1of1ForFork1_append_~elem~0.base, buildThread1of1ForFork1_append_#t~mem5.offset, buildThread1of1ForFork1_append_#t~malloc7.base] because there is no mapped edge [2019-12-07 16:45:47,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [513] [513] L1042-1-->L1044: Formula: (let ((.cse0 (bvadd v_buildThread1of1ForFork1_append_~elem~0.offset_56 (_ bv4 32))) (.cse1 (bvadd v_buildThread1of1ForFork1_append_~plist.offset_36 (_ bv4 32)))) (and (bvule .cse0 (select |v_#length_133| v_buildThread1of1ForFork1_append_~elem~0.base_62)) (= |v_#memory_int_71| (store |v_#memory_int_72| v_buildThread1of1ForFork1_append_~elem~0.base_62 (store (select |v_#memory_int_72| v_buildThread1of1ForFork1_append_~elem~0.base_62) v_buildThread1of1ForFork1_append_~elem~0.offset_56 (select (select |v_#memory_int_71| v_buildThread1of1ForFork1_append_~elem~0.base_62) v_buildThread1of1ForFork1_append_~elem~0.offset_56)))) (= |v_#memory_$Pointer$.offset_92| (store |v_#memory_$Pointer$.offset_93| v_buildThread1of1ForFork1_append_~elem~0.base_62 (store (select |v_#memory_$Pointer$.offset_93| v_buildThread1of1ForFork1_append_~elem~0.base_62) v_buildThread1of1ForFork1_append_~elem~0.offset_56 (select (select |v_#memory_$Pointer$.offset_93| v_buildThread1of1ForFork1_append_~plist.base_41) v_buildThread1of1ForFork1_append_~plist.offset_36)))) (= (store |v_#memory_$Pointer$.base_93| v_buildThread1of1ForFork1_append_~elem~0.base_62 (store (select |v_#memory_$Pointer$.base_93| v_buildThread1of1ForFork1_append_~elem~0.base_62) v_buildThread1of1ForFork1_append_~elem~0.offset_56 (select (select |v_#memory_$Pointer$.base_93| v_buildThread1of1ForFork1_append_~plist.base_41) v_buildThread1of1ForFork1_append_~plist.offset_36))) |v_#memory_$Pointer$.base_92|) (= (select |v_#valid_204| v_buildThread1of1ForFork1_append_~plist.base_41) (_ bv1 1)) (bvule v_buildThread1of1ForFork1_append_~plist.offset_36 .cse1) (bvule v_buildThread1of1ForFork1_append_~elem~0.offset_56 .cse0) (= (_ bv1 1) (select |v_#valid_204| v_buildThread1of1ForFork1_append_~elem~0.base_62)) (= v_buildThread1of1ForFork1_append_~elem~0.base_62 |v_buildThread1of1ForFork1_append_#t~malloc2.base_19|) (bvule .cse1 (select |v_#length_133| v_buildThread1of1ForFork1_append_~plist.base_41)) (= v_buildThread1of1ForFork1_append_~elem~0.offset_56 |v_buildThread1of1ForFork1_append_#t~malloc2.offset_19|))) InVars {buildThread1of1ForFork1_append_#t~malloc2.offset=|v_buildThread1of1ForFork1_append_#t~malloc2.offset_19|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_93|, #valid=|v_#valid_204|, #memory_int=|v_#memory_int_72|, #length=|v_#length_133|, buildThread1of1ForFork1_append_~plist.base=v_buildThread1of1ForFork1_append_~plist.base_41, buildThread1of1ForFork1_append_~plist.offset=v_buildThread1of1ForFork1_append_~plist.offset_36, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_93|, buildThread1of1ForFork1_append_#t~malloc2.base=|v_buildThread1of1ForFork1_append_#t~malloc2.base_19|} OutVars{buildThread1of1ForFork1_append_#t~malloc2.offset=|v_buildThread1of1ForFork1_append_#t~malloc2.offset_19|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_92|, buildThread1of1ForFork1_append_#t~mem3.base=|v_buildThread1of1ForFork1_append_#t~mem3.base_21|, buildThread1of1ForFork1_append_~elem~0.offset=v_buildThread1of1ForFork1_append_~elem~0.offset_56, buildThread1of1ForFork1_append_~plist.base=v_buildThread1of1ForFork1_append_~plist.base_41, buildThread1of1ForFork1_append_#t~mem3.offset=|v_buildThread1of1ForFork1_append_#t~mem3.offset_21|, #valid=|v_#valid_204|, #memory_int=|v_#memory_int_71|, #length=|v_#length_133|, buildThread1of1ForFork1_append_~plist.offset=v_buildThread1of1ForFork1_append_~plist.offset_36, buildThread1of1ForFork1_append_~elem~0.base=v_buildThread1of1ForFork1_append_~elem~0.base_62, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_92|, buildThread1of1ForFork1_append_#t~malloc2.base=|v_buildThread1of1ForFork1_append_#t~malloc2.base_19|} AuxVars[] AssignedVars[#memory_$Pointer$.base, buildThread1of1ForFork1_append_#t~mem3.base, buildThread1of1ForFork1_append_~elem~0.offset, #memory_int, buildThread1of1ForFork1_append_#t~mem3.offset, buildThread1of1ForFork1_append_~elem~0.base, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-07 16:45:47,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [532] [532] L1044-->L1044-8: Formula: (let ((.cse3 (select (select |#memory_$Pointer$.base_In435907422| buildThread1of1ForFork1_append_~elem~0.base_In435907422) buildThread1of1ForFork1_append_~elem~0.offset_In435907422)) (.cse4 (select (select |#memory_$Pointer$.offset_In435907422| buildThread1of1ForFork1_append_~elem~0.base_In435907422) buildThread1of1ForFork1_append_~elem~0.offset_In435907422)) (.cse11 (bvadd buildThread1of1ForFork1_append_~elem~0.offset_In435907422 (_ bv4 32)))) (let ((.cse1 (= (_ bv1 1) (select |#valid_In435907422| buildThread1of1ForFork1_append_~elem~0.base_In435907422))) (.cse7 (bvule .cse11 (select |#length_In435907422| buildThread1of1ForFork1_append_~elem~0.base_In435907422))) (.cse8 (bvule buildThread1of1ForFork1_append_~elem~0.offset_In435907422 .cse11)) (.cse5 (= |buildThread1of1ForFork1_append_#t~mem4.offset_Out435907422| (_ bv0 32))) (.cse9 (= |buildThread1of1ForFork1_append_#t~mem4.offset_Out435907422| .cse4)) (.cse6 (= (_ bv0 32) |buildThread1of1ForFork1_append_#t~mem4.base_Out435907422|)) (.cse10 (= .cse3 |buildThread1of1ForFork1_append_#t~mem4.base_Out435907422|))) (or (let ((.cse2 (bvadd |buildThread1of1ForFork1_append_#t~mem5.offset_Out435907422| (_ bv8 32))) (.cse0 (bvadd |buildThread1of1ForFork1_append_#t~mem5.offset_Out435907422| (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.offset_In435907422| |buildThread1of1ForFork1_append_#t~mem5.base_Out435907422|) .cse0) |buildThread1of1ForFork1_append_#t~mem6.offset_Out435907422|) .cse1 (bvule .cse0 .cse2) (= |buildThread1of1ForFork1_append_#t~ite8.offset_Out435907422| |buildThread1of1ForFork1_append_#t~mem6.offset_Out435907422|) (= |buildThread1of1ForFork1_append_#t~mem5.base_Out435907422| .cse3) (= |buildThread1of1ForFork1_append_#t~mem5.offset_Out435907422| .cse4) (or (not .cse5) (not .cse6)) (= |#valid_In435907422| |#valid_Out435907422|) (= |buildThread1of1ForFork1_append_#t~mem6.base_Out435907422| |buildThread1of1ForFork1_append_#t~ite8.base_Out435907422|) .cse7 .cse8 (bvule .cse2 (select |#length_In435907422| |buildThread1of1ForFork1_append_#t~mem5.base_Out435907422|)) .cse9 .cse10 (= |#length_In435907422| |#length_Out435907422|) (= |buildThread1of1ForFork1_append_#t~mem6.base_Out435907422| (select (select |#memory_$Pointer$.base_In435907422| |buildThread1of1ForFork1_append_#t~mem5.base_Out435907422|) .cse0)) (= (select |#valid_In435907422| |buildThread1of1ForFork1_append_#t~mem5.base_Out435907422|) (_ bv1 1)) (= |buildThread1of1ForFork1_append_#t~malloc7.offset_In435907422| |buildThread1of1ForFork1_append_#t~malloc7.offset_Out435907422|) (= |buildThread1of1ForFork1_append_#t~malloc7.base_In435907422| |buildThread1of1ForFork1_append_#t~malloc7.base_Out435907422|))) (and (= |#valid_Out435907422| (store |#valid_In435907422| |buildThread1of1ForFork1_append_#t~malloc7.base_Out435907422| (_ bv1 1))) .cse1 (= (select |#valid_In435907422| |buildThread1of1ForFork1_append_#t~malloc7.base_Out435907422|) (_ bv0 1)) (= |buildThread1of1ForFork1_append_#t~mem6.offset_In435907422| |buildThread1of1ForFork1_append_#t~mem6.offset_Out435907422|) (= |buildThread1of1ForFork1_append_#t~mem6.base_In435907422| |buildThread1of1ForFork1_append_#t~mem6.base_Out435907422|) (= |buildThread1of1ForFork1_append_#t~malloc7.offset_Out435907422| |buildThread1of1ForFork1_append_#t~ite8.offset_Out435907422|) .cse7 .cse8 .cse5 (= |buildThread1of1ForFork1_append_#t~ite8.base_Out435907422| |buildThread1of1ForFork1_append_#t~malloc7.base_Out435907422|) .cse9 (= |buildThread1of1ForFork1_append_#t~mem5.offset_In435907422| |buildThread1of1ForFork1_append_#t~mem5.offset_Out435907422|) .cse6 (bvult |buildThread1of1ForFork1_append_#t~malloc7.base_Out435907422| |#StackHeapBarrier_In435907422|) (= |buildThread1of1ForFork1_append_#t~mem5.base_In435907422| |buildThread1of1ForFork1_append_#t~mem5.base_Out435907422|) (= (store |#length_In435907422| |buildThread1of1ForFork1_append_#t~malloc7.base_Out435907422| (_ bv8 32)) |#length_Out435907422|) .cse10 (= |buildThread1of1ForFork1_append_#t~malloc7.offset_Out435907422| (_ bv0 32)) (not (= (_ bv0 32) |buildThread1of1ForFork1_append_#t~malloc7.base_Out435907422|)))))) InVars {#memory_$Pointer$.base=|#memory_$Pointer$.base_In435907422|, buildThread1of1ForFork1_append_~elem~0.offset=buildThread1of1ForFork1_append_~elem~0.offset_In435907422, buildThread1of1ForFork1_append_#t~malloc7.offset=|buildThread1of1ForFork1_append_#t~malloc7.offset_In435907422|, #StackHeapBarrier=|#StackHeapBarrier_In435907422|, buildThread1of1ForFork1_append_#t~mem6.offset=|buildThread1of1ForFork1_append_#t~mem6.offset_In435907422|, buildThread1of1ForFork1_append_#t~mem6.base=|buildThread1of1ForFork1_append_#t~mem6.base_In435907422|, #valid=|#valid_In435907422|, buildThread1of1ForFork1_append_#t~mem5.base=|buildThread1of1ForFork1_append_#t~mem5.base_In435907422|, #length=|#length_In435907422|, #memory_$Pointer$.offset=|#memory_$Pointer$.offset_In435907422|, buildThread1of1ForFork1_append_~elem~0.base=buildThread1of1ForFork1_append_~elem~0.base_In435907422, buildThread1of1ForFork1_append_#t~mem5.offset=|buildThread1of1ForFork1_append_#t~mem5.offset_In435907422|, buildThread1of1ForFork1_append_#t~malloc7.base=|buildThread1of1ForFork1_append_#t~malloc7.base_In435907422|} OutVars{buildThread1of1ForFork1_append_#t~mem4.offset=|buildThread1of1ForFork1_append_#t~mem4.offset_Out435907422|, #memory_$Pointer$.base=|#memory_$Pointer$.base_In435907422|, buildThread1of1ForFork1_append_#t~ite8.base=|buildThread1of1ForFork1_append_#t~ite8.base_Out435907422|, buildThread1of1ForFork1_append_~elem~0.offset=buildThread1of1ForFork1_append_~elem~0.offset_In435907422, buildThread1of1ForFork1_append_#t~ite8.offset=|buildThread1of1ForFork1_append_#t~ite8.offset_Out435907422|, buildThread1of1ForFork1_append_#t~malloc7.offset=|buildThread1of1ForFork1_append_#t~malloc7.offset_Out435907422|, #StackHeapBarrier=|#StackHeapBarrier_In435907422|, buildThread1of1ForFork1_append_#t~mem6.offset=|buildThread1of1ForFork1_append_#t~mem6.offset_Out435907422|, buildThread1of1ForFork1_append_#t~mem6.base=|buildThread1of1ForFork1_append_#t~mem6.base_Out435907422|, #valid=|#valid_Out435907422|, buildThread1of1ForFork1_append_#t~mem5.base=|buildThread1of1ForFork1_append_#t~mem5.base_Out435907422|, buildThread1of1ForFork1_append_#t~mem4.base=|buildThread1of1ForFork1_append_#t~mem4.base_Out435907422|, #length=|#length_Out435907422|, buildThread1of1ForFork1_append_#t~mem5.offset=|buildThread1of1ForFork1_append_#t~mem5.offset_Out435907422|, #memory_$Pointer$.offset=|#memory_$Pointer$.offset_In435907422|, buildThread1of1ForFork1_append_~elem~0.base=buildThread1of1ForFork1_append_~elem~0.base_In435907422, buildThread1of1ForFork1_append_#t~malloc7.base=|buildThread1of1ForFork1_append_#t~malloc7.base_Out435907422|} AuxVars[] AssignedVars[buildThread1of1ForFork1_append_#t~mem4.offset, buildThread1of1ForFork1_append_#t~mem6.offset, buildThread1of1ForFork1_append_#t~mem6.base, buildThread1of1ForFork1_append_#t~ite8.base, #valid, buildThread1of1ForFork1_append_#t~mem5.base, buildThread1of1ForFork1_append_#t~mem4.base, #length, buildThread1of1ForFork1_append_#t~ite8.offset, buildThread1of1ForFork1_append_#t~malloc7.offset, buildThread1of1ForFork1_append_#t~mem5.offset, buildThread1of1ForFork1_append_#t~malloc7.base] because there is no mapped edge [2019-12-07 16:45:47,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [458] [458] L1044-8-->L1044-10: Formula: (let ((.cse1 (bvadd v_buildThread1of1ForFork1_append_~elem~0.offset_28 (_ bv8 32))) (.cse0 (bvadd v_buildThread1of1ForFork1_append_~elem~0.offset_28 (_ bv4 32)))) (and (= |v_#memory_int_35| (store |v_#memory_int_36| v_buildThread1of1ForFork1_append_~elem~0.base_34 (store (select |v_#memory_int_36| v_buildThread1of1ForFork1_append_~elem~0.base_34) .cse0 (select (select |v_#memory_int_35| v_buildThread1of1ForFork1_append_~elem~0.base_34) .cse0)))) (bvule .cse0 .cse1) (= |v_#memory_$Pointer$.offset_43| (store |v_#memory_$Pointer$.offset_44| v_buildThread1of1ForFork1_append_~elem~0.base_34 (store (select |v_#memory_$Pointer$.offset_44| v_buildThread1of1ForFork1_append_~elem~0.base_34) .cse0 |v_buildThread1of1ForFork1_append_#t~ite8.offset_11|))) (= (_ bv1 1) (select |v_#valid_132| v_buildThread1of1ForFork1_append_~elem~0.base_34)) (bvule .cse1 (select |v_#length_81| v_buildThread1of1ForFork1_append_~elem~0.base_34)) (= (store |v_#memory_$Pointer$.base_44| v_buildThread1of1ForFork1_append_~elem~0.base_34 (store (select |v_#memory_$Pointer$.base_44| v_buildThread1of1ForFork1_append_~elem~0.base_34) .cse0 |v_buildThread1of1ForFork1_append_#t~ite8.base_11|)) |v_#memory_$Pointer$.base_43|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_44|, buildThread1of1ForFork1_append_#t~ite8.base=|v_buildThread1of1ForFork1_append_#t~ite8.base_11|, #valid=|v_#valid_132|, buildThread1of1ForFork1_append_~elem~0.offset=v_buildThread1of1ForFork1_append_~elem~0.offset_28, #memory_int=|v_#memory_int_36|, #length=|v_#length_81|, buildThread1of1ForFork1_append_#t~ite8.offset=|v_buildThread1of1ForFork1_append_#t~ite8.offset_11|, buildThread1of1ForFork1_append_~elem~0.base=v_buildThread1of1ForFork1_append_~elem~0.base_34, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_44|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_43|, buildThread1of1ForFork1_append_#t~ite8.base=|v_buildThread1of1ForFork1_append_#t~ite8.base_10|, #valid=|v_#valid_132|, buildThread1of1ForFork1_append_~elem~0.offset=v_buildThread1of1ForFork1_append_~elem~0.offset_28, #memory_int=|v_#memory_int_35|, #length=|v_#length_81|, buildThread1of1ForFork1_append_#t~ite8.offset=|v_buildThread1of1ForFork1_append_#t~ite8.offset_10|, buildThread1of1ForFork1_append_~elem~0.base=v_buildThread1of1ForFork1_append_~elem~0.base_34, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_43|} AuxVars[] AssignedVars[#memory_$Pointer$.base, buildThread1of1ForFork1_append_#t~ite8.base, #memory_int, buildThread1of1ForFork1_append_#t~ite8.offset, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-07 16:45:47,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [537] [537] L1044-10-->buildEXIT: Formula: (let ((.cse0 (bvadd v_buildThread1of1ForFork1_append_~plist.offset_47 (_ bv4 32)))) (and (= (_ bv0 32) |v_buildThread1of1ForFork1_#t~nondet9_23|) (= |v_#memory_int_89| (store |v_#memory_int_90| v_buildThread1of1ForFork1_append_~plist.base_52 (store (select |v_#memory_int_90| v_buildThread1of1ForFork1_append_~plist.base_52) v_buildThread1of1ForFork1_append_~plist.offset_47 (select (select |v_#memory_int_89| v_buildThread1of1ForFork1_append_~plist.base_52) v_buildThread1of1ForFork1_append_~plist.offset_47)))) (bvule .cse0 (select |v_#length_167| v_buildThread1of1ForFork1_append_~plist.base_52)) (= |v_buildThread1of1ForFork1_#res.offset_6| (_ bv0 32)) (= |v_#memory_$Pointer$.offset_118| (store |v_#memory_$Pointer$.offset_119| v_buildThread1of1ForFork1_append_~plist.base_52 (store (select |v_#memory_$Pointer$.offset_119| v_buildThread1of1ForFork1_append_~plist.base_52) v_buildThread1of1ForFork1_append_~plist.offset_47 v_buildThread1of1ForFork1_append_~elem~0.offset_73))) (= (_ bv0 32) |v_buildThread1of1ForFork1_#res.base_6|) (bvule v_buildThread1of1ForFork1_append_~plist.offset_47 .cse0) (= (select |v_#valid_248| v_buildThread1of1ForFork1_append_~plist.base_52) (_ bv1 1)) (= |v_#memory_$Pointer$.base_118| (store |v_#memory_$Pointer$.base_119| v_buildThread1of1ForFork1_append_~plist.base_52 (store (select |v_#memory_$Pointer$.base_119| v_buildThread1of1ForFork1_append_~plist.base_52) v_buildThread1of1ForFork1_append_~plist.offset_47 v_buildThread1of1ForFork1_append_~elem~0.base_79))))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_119|, buildThread1of1ForFork1_#t~nondet9=|v_buildThread1of1ForFork1_#t~nondet9_23|, #valid=|v_#valid_248|, buildThread1of1ForFork1_append_~elem~0.offset=v_buildThread1of1ForFork1_append_~elem~0.offset_73, #memory_int=|v_#memory_int_90|, #length=|v_#length_167|, buildThread1of1ForFork1_append_~plist.base=v_buildThread1of1ForFork1_append_~plist.base_52, buildThread1of1ForFork1_append_~plist.offset=v_buildThread1of1ForFork1_append_~plist.offset_47, buildThread1of1ForFork1_append_~elem~0.base=v_buildThread1of1ForFork1_append_~elem~0.base_79, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_119|} OutVars{buildThread1of1ForFork1_append_#t~mem4.offset=|v_buildThread1of1ForFork1_append_#t~mem4.offset_31|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_118|, buildThread1of1ForFork1_#res.base=|v_buildThread1of1ForFork1_#res.base_6|, buildThread1of1ForFork1_append_~elem~0.offset=v_buildThread1of1ForFork1_append_~elem~0.offset_73, buildThread1of1ForFork1_append_~plist.base=v_buildThread1of1ForFork1_append_~plist.base_52, buildThread1of1ForFork1_append_#t~mem6.offset=|v_buildThread1of1ForFork1_append_#t~mem6.offset_25|, buildThread1of1ForFork1_append_#t~mem6.base=|v_buildThread1of1ForFork1_append_#t~mem6.base_25|, buildThread1of1ForFork1_#t~nondet9=|v_buildThread1of1ForFork1_#t~nondet9_22|, #valid=|v_#valid_248|, #memory_int=|v_#memory_int_89|, buildThread1of1ForFork1_append_#t~mem4.base=|v_buildThread1of1ForFork1_append_#t~mem4.base_31|, buildThread1of1ForFork1_append_#t~mem5.base=|v_buildThread1of1ForFork1_append_#t~mem5.base_32|, #length=|v_#length_167|, buildThread1of1ForFork1_#res.offset=|v_buildThread1of1ForFork1_#res.offset_6|, buildThread1of1ForFork1_append_~plist.offset=v_buildThread1of1ForFork1_append_~plist.offset_47, buildThread1of1ForFork1_append_~elem~0.base=v_buildThread1of1ForFork1_append_~elem~0.base_79, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_118|, buildThread1of1ForFork1_append_#t~mem5.offset=|v_buildThread1of1ForFork1_append_#t~mem5.offset_31|} AuxVars[] AssignedVars[buildThread1of1ForFork1_append_#t~mem4.offset, #memory_$Pointer$.base, buildThread1of1ForFork1_append_#t~mem6.offset, buildThread1of1ForFork1_append_#t~mem6.base, buildThread1of1ForFork1_#res.base, buildThread1of1ForFork1_#t~nondet9, #memory_int, buildThread1of1ForFork1_append_#t~mem4.base, buildThread1of1ForFork1_append_#t~mem5.base, buildThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset, buildThread1of1ForFork1_append_#t~mem5.offset] because there is no mapped edge [2019-12-07 16:45:47,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [500] [500] deleteENTRY-->L1062-1: Formula: (and (= v_deleteThread1of1ForFork0_~list~1.base_69 v_deleteThread1of1ForFork0_~plist.base_7) (= v_deleteThread1of1ForFork0_~plist.offset_7 |v_deleteThread1of1ForFork0_#in~plist.offset_4|) (= v_deleteThread1of1ForFork0_~list~1.base_69 (_ bv0 32)) (= v_deleteThread1of1ForFork0_~list~1.offset_48 v_deleteThread1of1ForFork0_~plist.offset_7) (= v_deleteThread1of1ForFork0_~plist.base_7 |v_deleteThread1of1ForFork0_#in~plist.base_4|) (= v_deleteThread1of1ForFork0_~list~1.offset_48 (_ bv0 32))) InVars {deleteThread1of1ForFork0_#in~plist.offset=|v_deleteThread1of1ForFork0_#in~plist.offset_4|, deleteThread1of1ForFork0_#in~plist.base=|v_deleteThread1of1ForFork0_#in~plist.base_4|} OutVars{deleteThread1of1ForFork0_#in~plist.offset=|v_deleteThread1of1ForFork0_#in~plist.offset_4|, deleteThread1of1ForFork0_~plist.base=v_deleteThread1of1ForFork0_~plist.base_7, deleteThread1of1ForFork0_~list~1.base=v_deleteThread1of1ForFork0_~list~1.base_69, deleteThread1of1ForFork0_~list~1.offset=v_deleteThread1of1ForFork0_~list~1.offset_48, deleteThread1of1ForFork0_~plist.offset=v_deleteThread1of1ForFork0_~plist.offset_7, deleteThread1of1ForFork0_#in~plist.base=|v_deleteThread1of1ForFork0_#in~plist.base_4|} AuxVars[] AssignedVars[deleteThread1of1ForFork0_~plist.base, deleteThread1of1ForFork0_~list~1.base, deleteThread1of1ForFork0_~list~1.offset, deleteThread1of1ForFork0_~plist.offset] because there is no mapped edge [2019-12-07 16:45:47,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [470] [470] L1062-1-->deleteEXIT: Formula: (and (= (_ bv0 32) |v_deleteThread1of1ForFork0_#res.offset_4|) (= v_deleteThread1of1ForFork0_~list~1.offset_34 (_ bv0 32)) (= v_deleteThread1of1ForFork0_~list~1.base_54 (_ bv0 32)) (= (_ bv0 32) |v_deleteThread1of1ForFork0_#res.base_4|)) InVars {deleteThread1of1ForFork0_~list~1.base=v_deleteThread1of1ForFork0_~list~1.base_54, deleteThread1of1ForFork0_~list~1.offset=v_deleteThread1of1ForFork0_~list~1.offset_34} OutVars{deleteThread1of1ForFork0_~list~1.base=v_deleteThread1of1ForFork0_~list~1.base_54, deleteThread1of1ForFork0_~list~1.offset=v_deleteThread1of1ForFork0_~list~1.offset_34, deleteThread1of1ForFork0_#res.base=|v_deleteThread1of1ForFork0_#res.base_4|, deleteThread1of1ForFork0_#res.offset=|v_deleteThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[deleteThread1of1ForFork0_#res.base, deleteThread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:45:47,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [410] [410] L1074-2-->L1075-1: Formula: (let ((.cse1 (bvadd |v_ULTIMATE.start_main_~#id2~0.offset_9| (_ bv4 32)))) (and (= |v_ULTIMATE.start_main_#t~mem16_8| (let ((.cse0 (select |v_#memory_int_13| |v_ULTIMATE.start_main_~#id2~0.base_12|))) (concat (concat (concat (select .cse0 (bvadd |v_ULTIMATE.start_main_~#id2~0.offset_9| (_ bv3 32))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~#id2~0.offset_9| (_ bv2 32)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~#id2~0.offset_9| (_ bv1 32)))) (select .cse0 |v_ULTIMATE.start_main_~#id2~0.offset_9|)))) (bvule |v_ULTIMATE.start_main_~#id2~0.offset_9| .cse1) (= (select |v_#valid_70| |v_ULTIMATE.start_main_~#id2~0.base_12|) (_ bv1 1)) (bvule .cse1 (select |v_#length_43| |v_ULTIMATE.start_main_~#id2~0.base_12|)))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_12|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_9|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_13|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_12|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_9|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~mem16] because there is no mapped edge [2019-12-07 16:45:47,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [542] [542] L1076-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (not (= |v_ULTIMATE.start_main_old_#valid_15| |v_#valid_254|)) (= (store (store |v_#valid_255| |v_ULTIMATE.start_main_~#id1~0.base_58| (_ bv0 1)) |v_ULTIMATE.start_main_~#id2~0.base_40| (_ bv0 1)) |v_#valid_254|) (= (_ bv0 32) |v_ULTIMATE.start_main_#res_10|)) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_40|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_58|, #valid=|v_#valid_255|, ULTIMATE.start_main_old_#valid=|v_ULTIMATE.start_main_old_#valid_15|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_39|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_26|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_57|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_10|, #valid=|v_#valid_254|, ULTIMATE.start_main_old_#valid=|v_ULTIMATE.start_main_old_#valid_15|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_46|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~#id1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-07 16:45:47,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:45:47 BasicIcfg [2019-12-07 16:45:47,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:45:47,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:45:47,859 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:45:47,859 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:45:47,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:42:43" (3/4) ... [2019-12-07 16:45:47,861 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 16:45:47,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:45:47,862 INFO L168 Benchmark]: Toolchain (without parser) took 185349.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.9 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -249.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:45:47,862 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:45:47,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -101.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:45:47,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:45:47,862 INFO L168 Benchmark]: Boogie Preprocessor took 33.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:45:47,862 INFO L168 Benchmark]: RCFGBuilder took 434.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:45:47,862 INFO L168 Benchmark]: TraceAbstraction took 184356.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -191.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:45:47,863 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:45:47,863 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 472.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -101.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 434.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 184356.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -191.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 19.7s, 138 ProgramPointsBefore, 66 ProgramPointsAfterwards, 139 TransitionsBefore, 66 TransitionsAfterwards, 736 CoEnabledTransitionPairs, 8 FixpointIterations, 30 TrivialSequentialCompositions, 148 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 316 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 29 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 1142 CheckedPairsTotal, 183 TotalNumberOfCompositions - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [plist={0:0}] [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\result={0:0}, list={0:0}, plist={0:0}, plist={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 132 locations, 38 error locations. Result: UNSAFE, OverallTime: 184.2s, OverallIterations: 16, TraceHistogramMax: 2, AutomataDifference: 100.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 324 SDtfs, 2050 SDslu, 565 SDs, 0 SdLazy, 2241 SolverSat, 744 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 57.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 115 SyntacticMatches, 7 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 73.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 759 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 57.7s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 226 ConstructedInterpolants, 66 QuantifiedInterpolants, 89332 SizeOfPredicates, 321 NumberOfNonLiveVariables, 1167 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 5/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...