./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/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 d58cec473cb766e48ec31cf93ef2517d91aaecb5 ............................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/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 d58cec473cb766e48ec31cf93ef2517d91aaecb5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 06:42:48,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:42:48,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:42:48,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:42:48,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:42:48,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:42:48,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:42:48,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:42:48,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:42:48,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:42:48,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:42:48,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:42:48,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:42:48,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:42:48,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:42:48,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:42:48,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:42:48,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:42:48,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:42:48,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:42:48,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:42:48,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:42:48,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:42:48,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:42:48,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:42:48,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:42:48,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:42:48,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:42:48,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:42:48,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:42:48,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:42:48,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:42:48,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:42:48,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:42:48,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:42:48,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:42:48,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:42:48,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:42:48,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:42:48,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:42:48,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:42:48,298 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 06:42:48,321 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:42:48,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:42:48,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:42:48,332 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:42:48,332 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:42:48,333 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:42:48,333 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 06:42:48,333 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:42:48,333 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:42:48,333 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 06:42:48,333 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 06:42:48,334 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:42:48,334 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 06:42:48,334 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 06:42:48,334 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 06:42:48,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 06:42:48,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 06:42:48,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:42:48,335 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:42:48,336 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 06:42:48,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:42:48,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:42:48,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:42:48,336 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 06:42:48,337 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 06:42:48,337 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 06:42:48,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:42:48,337 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:42:48,337 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:42:48,337 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:42:48,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:42:48,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:42:48,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:42:48,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:42:48,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:42:48,339 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 06:42:48,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 06:42:48,339 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:42:48,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:42:48,339 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/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 -> d58cec473cb766e48ec31cf93ef2517d91aaecb5 [2020-12-09 06:42:48,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:42:48,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:42:48,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:42:48,548 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:42:48,548 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:42:48,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2020-12-09 06:42:48,588 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data/89eca3cef/583f069ff16443f7839a2ec3a1d60264/FLAG188f6f1d2 [2020-12-09 06:42:49,006 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:42:49,007 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2020-12-09 06:42:49,018 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data/89eca3cef/583f069ff16443f7839a2ec3a1d60264/FLAG188f6f1d2 [2020-12-09 06:42:49,362 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data/89eca3cef/583f069ff16443f7839a2ec3a1d60264 [2020-12-09 06:42:49,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:42:49,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:42:49,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:42:49,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:42:49,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:42:49,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:42:49" (1/1) ... [2020-12-09 06:42:49,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1d8594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:49, skipping insertion in model container [2020-12-09 06:42:49,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:42:49" (1/1) ... [2020-12-09 06:42:49,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:42:49,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:42:49,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:42:49,689 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2020-12-09 06:42:49,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4788cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:49, skipping insertion in model container [2020-12-09 06:42:49,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:42:49,690 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2020-12-09 06:42:49,692 INFO L168 Benchmark]: Toolchain (without parser) took 325.63 ms. Allocated memory is still 102.8 MB. Free memory was 75.4 MB in the beginning and 71.0 MB in the end (delta: 4.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 06:42:49,692 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 71.3 MB. Free memory was 46.7 MB in the beginning and 46.7 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:42:49,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.69 ms. Allocated memory is still 102.8 MB. Free memory was 75.1 MB in the beginning and 71.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 06:42:49,694 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 71.3 MB. Free memory was 46.7 MB in the beginning and 46.7 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 323.69 ms. Allocated memory is still 102.8 MB. Free memory was 75.1 MB in the beginning and 71.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 06:42:51,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:42:51,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:42:51,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:42:51,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:42:51,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:42:51,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:42:51,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:42:51,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:42:51,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:42:51,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:42:51,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:42:51,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:42:51,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:42:51,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:42:51,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:42:51,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:42:51,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:42:51,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:42:51,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:42:51,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:42:51,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:42:51,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:42:51,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:42:51,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:42:51,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:42:51,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:42:51,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:42:51,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:42:51,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:42:51,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:42:51,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:42:51,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:42:51,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:42:51,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:42:51,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:42:51,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:42:51,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:42:51,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:42:51,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:42:51,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:42:51,199 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 06:42:51,228 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:42:51,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:42:51,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:42:51,229 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:42:51,229 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:42:51,229 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:42:51,230 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:42:51,230 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:42:51,230 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:42:51,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 06:42:51,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 06:42:51,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:42:51,231 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:42:51,231 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 06:42:51,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:42:51,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:42:51,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:42:51,232 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 06:42:51,232 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 06:42:51,233 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 06:42:51,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:42:51,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:42:51,233 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 06:42:51,233 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 06:42:51,234 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:42:51,234 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:42:51,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:42:51,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 06:42:51,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:42:51,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:42:51,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:42:51,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:42:51,235 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 06:42:51,236 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 06:42:51,236 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:42:51,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:42:51,236 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/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 -> d58cec473cb766e48ec31cf93ef2517d91aaecb5 [2020-12-09 06:42:51,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:42:51,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:42:51,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:42:51,471 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:42:51,472 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:42:51,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2020-12-09 06:42:51,515 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data/2a3f143c8/b2036f76314941d49bb9f96e52e71951/FLAG7e3fb6ed2 [2020-12-09 06:42:51,999 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:42:52,000 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2020-12-09 06:42:52,014 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data/2a3f143c8/b2036f76314941d49bb9f96e52e71951/FLAG7e3fb6ed2 [2020-12-09 06:42:52,027 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/data/2a3f143c8/b2036f76314941d49bb9f96e52e71951 [2020-12-09 06:42:52,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:42:52,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:42:52,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:42:52,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:42:52,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:42:52,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475dbec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52, skipping insertion in model container [2020-12-09 06:42:52,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:42:52,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:42:52,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:42:52,406 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-12-09 06:42:52,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:42:52,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:42:52,466 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 06:42:52,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:42:52,581 INFO L208 MainTranslator]: Completed translation [2020-12-09 06:42:52,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52 WrapperNode [2020-12-09 06:42:52,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:42:52,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 06:42:52,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 06:42:52,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 06:42:52,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 06:42:52,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 06:42:52,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 06:42:52,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 06:42:52,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... [2020-12-09 06:42:52,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 06:42:52,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 06:42:52,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 06:42:52,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 06:42:52,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:42:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 06:42:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 06:42:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 06:42:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 06:42:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 06:42:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 06:42:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 06:42:52,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 06:42:53,128 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 06:42:53,128 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2020-12-09 06:42:53,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:42:53 BoogieIcfgContainer [2020-12-09 06:42:53,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 06:42:53,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 06:42:53,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 06:42:53,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 06:42:53,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:42:52" (1/3) ... [2020-12-09 06:42:53,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6857c7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:42:53, skipping insertion in model container [2020-12-09 06:42:53,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:42:52" (2/3) ... [2020-12-09 06:42:53,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6857c7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:42:53, skipping insertion in model container [2020-12-09 06:42:53,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:42:53" (3/3) ... [2020-12-09 06:42:53,137 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1.i [2020-12-09 06:42:53,147 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 06:42:53,151 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2020-12-09 06:42:53,159 INFO L253 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2020-12-09 06:42:53,174 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 06:42:53,175 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 06:42:53,175 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 06:42:53,175 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 06:42:53,175 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 06:42:53,175 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 06:42:53,175 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 06:42:53,175 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 06:42:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2020-12-09 06:42:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 06:42:53,193 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:42:53,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 06:42:53,194 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:42:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:42:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 889508834, now seen corresponding path program 1 times [2020-12-09 06:42:53,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:42:53,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261680787] [2020-12-09 06:42:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 06:42:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:42:53,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:42:53,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:42:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:42:53,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:42:53,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261680787] [2020-12-09 06:42:53,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:42:53,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:42:53,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653524775] [2020-12-09 06:42:53,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:42:53,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:42:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:42:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:42:53,345 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2020-12-09 06:42:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:42:53,495 INFO L93 Difference]: Finished difference Result 315 states and 337 transitions. [2020-12-09 06:42:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:42:53,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 06:42:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:42:53,505 INFO L225 Difference]: With dead ends: 315 [2020-12-09 06:42:53,505 INFO L226 Difference]: Without dead ends: 307 [2020-12-09 06:42:53,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:42:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-12-09 06:42:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 84. [2020-12-09 06:42:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-12-09 06:42:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2020-12-09 06:42:53,537 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2020-12-09 06:42:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:42:53,537 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2020-12-09 06:42:53,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:42:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2020-12-09 06:42:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 06:42:53,538 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:42:53,538 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 06:42:53,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 06:42:53,739 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:42:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:42:53,741 INFO L82 PathProgramCache]: Analyzing trace with hash 889568416, now seen corresponding path program 1 times [2020-12-09 06:42:53,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:42:53,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127418074] [2020-12-09 06:42:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 06:42:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:42:53,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 06:42:53,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:42:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:42:53,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:42:53,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127418074] [2020-12-09 06:42:53,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:42:53,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:42:53,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851197224] [2020-12-09 06:42:53,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 06:42:53,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:42:53,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 06:42:53,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:42:53,898 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 3 states. [2020-12-09 06:42:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:42:54,031 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2020-12-09 06:42:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 06:42:54,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-12-09 06:42:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:42:54,033 INFO L225 Difference]: With dead ends: 160 [2020-12-09 06:42:54,033 INFO L226 Difference]: Without dead ends: 159 [2020-12-09 06:42:54,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:42:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-09 06:42:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 82. [2020-12-09 06:42:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-09 06:42:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2020-12-09 06:42:54,043 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 6 [2020-12-09 06:42:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:42:54,043 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2020-12-09 06:42:54,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 06:42:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2020-12-09 06:42:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:42:54,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:42:54,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:42:54,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 06:42:54,245 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:42:54,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:42:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash -592189871, now seen corresponding path program 1 times [2020-12-09 06:42:54,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:42:54,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704962799] [2020-12-09 06:42:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 06:42:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:42:54,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:42:54,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:42:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:42:54,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:42:54,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704962799] [2020-12-09 06:42:54,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:42:54,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:42:54,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921084395] [2020-12-09 06:42:54,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:42:54,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:42:54,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:42:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:42:54,403 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 4 states. [2020-12-09 06:42:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:42:54,495 INFO L93 Difference]: Finished difference Result 294 states and 311 transitions. [2020-12-09 06:42:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:42:54,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 06:42:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:42:54,497 INFO L225 Difference]: With dead ends: 294 [2020-12-09 06:42:54,497 INFO L226 Difference]: Without dead ends: 294 [2020-12-09 06:42:54,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:42:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-12-09 06:42:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 84. [2020-12-09 06:42:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-12-09 06:42:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2020-12-09 06:42:54,505 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 9 [2020-12-09 06:42:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:42:54,505 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2020-12-09 06:42:54,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:42:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2020-12-09 06:42:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:42:54,505 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:42:54,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:42:54,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 06:42:54,708 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:42:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:42:54,710 INFO L82 PathProgramCache]: Analyzing trace with hash -592189907, now seen corresponding path program 1 times [2020-12-09 06:42:54,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:42:54,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526646057] [2020-12-09 06:42:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 06:42:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:42:54,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:42:54,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:42:54,834 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:42:54,835 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:42:54,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:42:54,840 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:42:54,841 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:42:54,878 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:42:54,879 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 06:42:54,884 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:42:54,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:42:54,897 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:42:54,898 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2020-12-09 06:42:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:42:54,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:42:54,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526646057] [2020-12-09 06:42:54,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:42:54,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:42:54,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589026172] [2020-12-09 06:42:54,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:42:54,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:42:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:42:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:42:54,940 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 5 states. [2020-12-09 06:42:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:42:55,234 INFO L93 Difference]: Finished difference Result 253 states and 271 transitions. [2020-12-09 06:42:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:42:55,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 06:42:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:42:55,237 INFO L225 Difference]: With dead ends: 253 [2020-12-09 06:42:55,237 INFO L226 Difference]: Without dead ends: 253 [2020-12-09 06:42:55,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:42:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-12-09 06:42:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 95. [2020-12-09 06:42:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-12-09 06:42:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2020-12-09 06:42:55,244 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 9 [2020-12-09 06:42:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:42:55,244 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2020-12-09 06:42:55,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:42:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2020-12-09 06:42:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:42:55,244 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:42:55,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:42:55,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 06:42:55,447 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:42:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:42:55,449 INFO L82 PathProgramCache]: Analyzing trace with hash -592189906, now seen corresponding path program 1 times [2020-12-09 06:42:55,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:42:55,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263023954] [2020-12-09 06:42:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 06:42:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:42:55,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 06:42:55,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:42:55,567 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:42:55,568 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:42:55,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:42:55,578 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:42:55,579 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:42:55,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:42:55,586 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:42:55,586 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 06:42:55,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:42:55,635 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 06:42:55,639 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:42:55,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:42:55,665 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:42:55,666 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 06:42:55,668 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:42:55,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:42:55,682 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:42:55,683 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 06:42:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:42:55,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:42:55,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263023954] [2020-12-09 06:42:55,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:42:55,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:42:55,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253822055] [2020-12-09 06:42:55,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:42:55,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:42:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:42:55,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:42:55,701 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2020-12-09 06:42:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:42:56,112 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2020-12-09 06:42:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:42:56,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-09 06:42:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:42:56,113 INFO L225 Difference]: With dead ends: 192 [2020-12-09 06:42:56,114 INFO L226 Difference]: Without dead ends: 192 [2020-12-09 06:42:56,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:42:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-12-09 06:42:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 133. [2020-12-09 06:42:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-12-09 06:42:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 174 transitions. [2020-12-09 06:42:56,120 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 174 transitions. Word has length 9 [2020-12-09 06:42:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:42:56,120 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 174 transitions. [2020-12-09 06:42:56,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:42:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2020-12-09 06:42:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:42:56,121 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:42:56,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:42:56,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 06:42:56,322 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:42:56,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:42:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1182817455, now seen corresponding path program 1 times [2020-12-09 06:42:56,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:42:56,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569528045] [2020-12-09 06:42:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 06:42:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:42:56,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 06:42:56,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:42:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:42:56,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:42:56,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569528045] [2020-12-09 06:42:56,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:42:56,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:42:56,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705874091] [2020-12-09 06:42:56,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:42:56,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:42:56,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:42:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:42:56,400 INFO L87 Difference]: Start difference. First operand 133 states and 174 transitions. Second operand 4 states. [2020-12-09 06:42:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:42:56,457 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2020-12-09 06:42:56,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:42:56,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 06:42:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:42:56,458 INFO L225 Difference]: With dead ends: 155 [2020-12-09 06:42:56,458 INFO L226 Difference]: Without dead ends: 153 [2020-12-09 06:42:56,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:42:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-12-09 06:42:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2020-12-09 06:42:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-12-09 06:42:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2020-12-09 06:42:56,462 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 9 [2020-12-09 06:42:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:42:56,462 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2020-12-09 06:42:56,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:42:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2020-12-09 06:42:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 06:42:56,462 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:42:56,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:42:56,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 06:42:56,664 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:42:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:42:56,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1176169616, now seen corresponding path program 1 times [2020-12-09 06:42:56,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:42:56,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376528282] [2020-12-09 06:42:56,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 06:42:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:42:56,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:42:56,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:42:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:42:56,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:42:56,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376528282] [2020-12-09 06:42:56,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:42:56,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:42:56,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923116819] [2020-12-09 06:42:56,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:42:56,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:42:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:42:56,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:42:56,771 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 5 states. [2020-12-09 06:42:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:42:56,874 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2020-12-09 06:42:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:42:56,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 06:42:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:42:56,876 INFO L225 Difference]: With dead ends: 151 [2020-12-09 06:42:56,876 INFO L226 Difference]: Without dead ends: 151 [2020-12-09 06:42:56,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:42:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-12-09 06:42:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 83. [2020-12-09 06:42:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-12-09 06:42:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2020-12-09 06:42:56,879 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 10 [2020-12-09 06:42:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:42:56,879 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2020-12-09 06:42:56,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:42:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2020-12-09 06:42:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 06:42:56,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:42:56,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:42:57,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 06:42:57,082 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:42:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:42:57,084 INFO L82 PathProgramCache]: Analyzing trace with hash -722596971, now seen corresponding path program 1 times [2020-12-09 06:42:57,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:42:57,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573276954] [2020-12-09 06:42:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 06:42:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:42:57,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 06:42:57,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:42:57,247 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:42:57,248 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 06:42:57,250 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:42:57,263 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 06:42:57,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:42:57,267 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:42:57,267 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 06:42:57,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:42:57,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:42:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:42:59,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:42:59,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573276954] [2020-12-09 06:42:59,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:42:59,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:42:59,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813445683] [2020-12-09 06:42:59,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:42:59,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:42:59,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:42:59,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2020-12-09 06:42:59,376 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 7 states. [2020-12-09 06:43:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:02,011 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2020-12-09 06:43:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 06:43:02,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-12-09 06:43:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:02,013 INFO L225 Difference]: With dead ends: 168 [2020-12-09 06:43:02,013 INFO L226 Difference]: Without dead ends: 164 [2020-12-09 06:43:02,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=21, Invalid=34, Unknown=1, NotChecked=0, Total=56 [2020-12-09 06:43:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-09 06:43:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 78. [2020-12-09 06:43:02,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-09 06:43:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2020-12-09 06:43:02,016 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 12 [2020-12-09 06:43:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:02,016 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2020-12-09 06:43:02,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:43:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2020-12-09 06:43:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 06:43:02,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:02,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:02,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 06:43:02,219 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash -493394203, now seen corresponding path program 1 times [2020-12-09 06:43:02,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:02,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321118711] [2020-12-09 06:43:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:02,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:43:02,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:02,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:02,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321118711] [2020-12-09 06:43:02,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:02,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:02,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474320452] [2020-12-09 06:43:02,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:02,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:02,296 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 4 states. [2020-12-09 06:43:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:02,349 INFO L93 Difference]: Finished difference Result 251 states and 262 transitions. [2020-12-09 06:43:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:43:02,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 06:43:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:02,351 INFO L225 Difference]: With dead ends: 251 [2020-12-09 06:43:02,351 INFO L226 Difference]: Without dead ends: 251 [2020-12-09 06:43:02,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-12-09 06:43:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 80. [2020-12-09 06:43:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-12-09 06:43:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2020-12-09 06:43:02,354 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 14 [2020-12-09 06:43:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:02,354 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2020-12-09 06:43:02,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-12-09 06:43:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 06:43:02,354 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:02,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:02,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 06:43:02,555 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:02,555 INFO L82 PathProgramCache]: Analyzing trace with hash -493394216, now seen corresponding path program 1 times [2020-12-09 06:43:02,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:02,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209446109] [2020-12-09 06:43:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:02,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:43:02,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:02,620 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:02,620 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:02,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:02,622 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:02,622 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:43:02,650 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:02,651 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 06:43:02,653 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:02,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:02,660 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:02,661 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:17 [2020-12-09 06:43:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:02,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:02,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209446109] [2020-12-09 06:43:02,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:02,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:02,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374434979] [2020-12-09 06:43:02,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:43:02,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:02,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:43:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:02,684 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2020-12-09 06:43:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:02,969 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2020-12-09 06:43:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:43:02,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-09 06:43:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:02,971 INFO L225 Difference]: With dead ends: 220 [2020-12-09 06:43:02,971 INFO L226 Difference]: Without dead ends: 220 [2020-12-09 06:43:02,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:43:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-12-09 06:43:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 93. [2020-12-09 06:43:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-12-09 06:43:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2020-12-09 06:43:02,974 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 14 [2020-12-09 06:43:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:02,974 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2020-12-09 06:43:02,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:43:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2020-12-09 06:43:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 06:43:02,974 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:02,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:03,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 06:43:03,177 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:03,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:03,178 INFO L82 PathProgramCache]: Analyzing trace with hash -493394215, now seen corresponding path program 1 times [2020-12-09 06:43:03,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:03,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216871954] [2020-12-09 06:43:03,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:03,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 06:43:03,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:03,329 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:03,330 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:03,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:03,340 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:03,341 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:03,347 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:03,348 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:03,348 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 06:43:03,388 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:03,389 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 06:43:03,390 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:03,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:03,404 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-09 06:43:03,405 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:03,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:03,417 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:03,417 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2020-12-09 06:43:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:03,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:03,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216871954] [2020-12-09 06:43:03,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:03,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:43:03,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240934180] [2020-12-09 06:43:03,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:43:03,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:03,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:43:03,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:43:03,431 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2020-12-09 06:43:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:03,743 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2020-12-09 06:43:03,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:43:03,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-09 06:43:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:03,744 INFO L225 Difference]: With dead ends: 215 [2020-12-09 06:43:03,745 INFO L226 Difference]: Without dead ends: 215 [2020-12-09 06:43:03,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:43:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-09 06:43:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 123. [2020-12-09 06:43:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-12-09 06:43:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2020-12-09 06:43:03,748 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 14 [2020-12-09 06:43:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:03,748 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2020-12-09 06:43:03,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:43:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2020-12-09 06:43:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 06:43:03,749 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:03,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:03,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-09 06:43:03,950 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:03,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:03,952 INFO L82 PathProgramCache]: Analyzing trace with hash 186664154, now seen corresponding path program 1 times [2020-12-09 06:43:03,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:03,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733519574] [2020-12-09 06:43:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:04,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 06:43:04,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:04,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:04,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733519574] [2020-12-09 06:43:04,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:04,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:04,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501599066] [2020-12-09 06:43:04,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:04,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:04,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:04,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:04,161 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand 4 states. [2020-12-09 06:43:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:04,214 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2020-12-09 06:43:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:43:04,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 06:43:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:04,215 INFO L225 Difference]: With dead ends: 143 [2020-12-09 06:43:04,215 INFO L226 Difference]: Without dead ends: 141 [2020-12-09 06:43:04,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-12-09 06:43:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 80. [2020-12-09 06:43:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-12-09 06:43:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2020-12-09 06:43:04,217 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 14 [2020-12-09 06:43:04,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:04,218 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2020-12-09 06:43:04,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:04,218 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-12-09 06:43:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 06:43:04,218 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:04,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:04,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-09 06:43:04,420 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:04,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1886496085, now seen corresponding path program 1 times [2020-12-09 06:43:04,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:04,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160554910] [2020-12-09 06:43:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:04,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 06:43:04,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:04,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:04,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160554910] [2020-12-09 06:43:04,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:04,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:04,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956112916] [2020-12-09 06:43:04,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:43:04,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:04,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:43:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:43:04,656 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 6 states. [2020-12-09 06:43:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:04,760 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-12-09 06:43:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:43:04,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 06:43:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:04,761 INFO L225 Difference]: With dead ends: 79 [2020-12-09 06:43:04,761 INFO L226 Difference]: Without dead ends: 79 [2020-12-09 06:43:04,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:43:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-09 06:43:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-09 06:43:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 06:43:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2020-12-09 06:43:04,763 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 15 [2020-12-09 06:43:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:04,763 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-12-09 06:43:04,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:43:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-12-09 06:43:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:43:04,763 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:04,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:04,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-09 06:43:04,965 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:04,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:04,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1705438503, now seen corresponding path program 1 times [2020-12-09 06:43:04,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:04,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935427761] [2020-12-09 06:43:04,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:05,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 06:43:05,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:05,078 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:05,078 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:05,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:05,080 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:05,080 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2020-12-09 06:43:05,114 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:05,115 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 06:43:05,117 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:05,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:05,123 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:05,123 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2020-12-09 06:43:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:05,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:05,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935427761] [2020-12-09 06:43:05,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:05,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:43:05,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351057117] [2020-12-09 06:43:05,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:43:05,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:43:05,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:43:05,167 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2020-12-09 06:43:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:05,508 INFO L93 Difference]: Finished difference Result 203 states and 213 transitions. [2020-12-09 06:43:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:43:05,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-09 06:43:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:05,510 INFO L225 Difference]: With dead ends: 203 [2020-12-09 06:43:05,510 INFO L226 Difference]: Without dead ends: 203 [2020-12-09 06:43:05,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:43:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-12-09 06:43:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 82. [2020-12-09 06:43:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-09 06:43:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2020-12-09 06:43:05,513 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 16 [2020-12-09 06:43:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:05,513 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2020-12-09 06:43:05,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:43:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2020-12-09 06:43:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:43:05,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:05,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:05,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-09 06:43:05,716 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:05,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1705438502, now seen corresponding path program 1 times [2020-12-09 06:43:05,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:05,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268434996] [2020-12-09 06:43:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:05,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 06:43:05,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:05,938 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:05,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:05,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:05,949 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:05,949 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:05,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:05,957 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:05,957 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 06:43:05,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:43:05,992 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 06:43:05,993 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:06,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:06,017 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:06,017 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 06:43:06,018 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:06,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:06,031 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:06,031 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 06:43:06,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:43:06,058 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 06:43:06,059 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:06,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:06,081 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:06,081 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 06:43:06,082 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:06,090 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:06,092 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:06,092 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 06:43:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:06,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:06,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268434996] [2020-12-09 06:43:06,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:06,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:43:06,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965389505] [2020-12-09 06:43:06,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:43:06,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:43:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:43:06,113 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 7 states. [2020-12-09 06:43:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:06,592 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2020-12-09 06:43:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:43:06,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 06:43:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:06,593 INFO L225 Difference]: With dead ends: 171 [2020-12-09 06:43:06,593 INFO L226 Difference]: Without dead ends: 171 [2020-12-09 06:43:06,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 06:43:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-09 06:43:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 81. [2020-12-09 06:43:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-09 06:43:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2020-12-09 06:43:06,595 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 16 [2020-12-09 06:43:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:06,595 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2020-12-09 06:43:06,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:43:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2020-12-09 06:43:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:43:06,596 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:06,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:06,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-09 06:43:06,797 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1648180201, now seen corresponding path program 1 times [2020-12-09 06:43:06,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:06,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590603983] [2020-12-09 06:43:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:06,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 06:43:06,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:06,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:06,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590603983] [2020-12-09 06:43:06,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:06,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:06,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855592734] [2020-12-09 06:43:06,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:06,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:06,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:06,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:06,893 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 4 states. [2020-12-09 06:43:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:06,940 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-12-09 06:43:06,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:43:06,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 06:43:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:06,941 INFO L225 Difference]: With dead ends: 133 [2020-12-09 06:43:06,941 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 06:43:06,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 06:43:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 77. [2020-12-09 06:43:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 06:43:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2020-12-09 06:43:06,943 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 16 [2020-12-09 06:43:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:06,944 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2020-12-09 06:43:06,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2020-12-09 06:43:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 06:43:06,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:06,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:07,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-12-09 06:43:07,146 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:07,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:07,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1751106330, now seen corresponding path program 1 times [2020-12-09 06:43:07,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:07,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673440923] [2020-12-09 06:43:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:07,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 06:43:07,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:07,252 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:07,252 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:07,254 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,255 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:43:07,270 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:07,270 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 06:43:07,271 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,273 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:07,273 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,273 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-12-09 06:43:07,291 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 06:43:07,291 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:07,297 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,297 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-09 06:43:07,341 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:07,341 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2020-12-09 06:43:07,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:43:07,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:43:07,344 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:07,354 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,354 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2020-12-09 06:43:07,389 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-09 06:43:07,390 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:07,395 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:07,396 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2020-12-09 06:43:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:07,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:07,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673440923] [2020-12-09 06:43:07,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:07,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 06:43:07,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079081814] [2020-12-09 06:43:07,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 06:43:07,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:07,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 06:43:07,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-12-09 06:43:07,422 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 11 states. [2020-12-09 06:43:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:08,257 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2020-12-09 06:43:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 06:43:08,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-12-09 06:43:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:08,258 INFO L225 Difference]: With dead ends: 171 [2020-12-09 06:43:08,258 INFO L226 Difference]: Without dead ends: 171 [2020-12-09 06:43:08,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2020-12-09 06:43:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-09 06:43:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 79. [2020-12-09 06:43:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 06:43:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2020-12-09 06:43:08,262 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 18 [2020-12-09 06:43:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:08,262 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2020-12-09 06:43:08,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 06:43:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-12-09 06:43:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 06:43:08,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:08,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:08,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-12-09 06:43:08,464 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1751106331, now seen corresponding path program 1 times [2020-12-09 06:43:08,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:08,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991316048] [2020-12-09 06:43:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:08,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 06:43:08,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:08,621 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:08,622 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,624 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,624 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:43:08,641 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_34|], 3=[|v_#valid_65|]} [2020-12-09 06:43:08,644 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:08,644 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,667 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,667 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-12-09 06:43:08,668 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,676 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,677 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,677 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2020-12-09 06:43:08,715 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 06:43:08,716 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,736 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 06:43:08,736 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,751 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,751 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:39 [2020-12-09 06:43:08,785 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_35|], 3=[|v_#valid_66|]} [2020-12-09 06:43:08,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:43:08,790 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 06:43:08,791 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,829 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,829 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2020-12-09 06:43:08,831 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,858 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,858 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:29 [2020-12-09 06:43:08,908 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,909 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 64 [2020-12-09 06:43:08,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 06:43:08,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 06:43:08,911 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,929 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2020-12-09 06:43:08,930 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,942 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:08,943 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:08,943 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:27 [2020-12-09 06:43:08,999 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-09 06:43:09,000 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:09,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:09,010 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-09 06:43:09,011 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:09,019 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:09,020 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:09,020 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:11 [2020-12-09 06:43:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:09,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:09,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991316048] [2020-12-09 06:43:09,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:09,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 06:43:09,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78922789] [2020-12-09 06:43:09,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 06:43:09,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 06:43:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:43:09,056 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 13 states. [2020-12-09 06:43:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:10,585 INFO L93 Difference]: Finished difference Result 170 states and 175 transitions. [2020-12-09 06:43:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 06:43:10,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-12-09 06:43:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:10,587 INFO L225 Difference]: With dead ends: 170 [2020-12-09 06:43:10,587 INFO L226 Difference]: Without dead ends: 170 [2020-12-09 06:43:10,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2020-12-09 06:43:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-09 06:43:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 78. [2020-12-09 06:43:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-09 06:43:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2020-12-09 06:43:10,589 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 18 [2020-12-09 06:43:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:10,589 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2020-12-09 06:43:10,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 06:43:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-12-09 06:43:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 06:43:10,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:10,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:10,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-12-09 06:43:10,791 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:10,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:10,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1469928108, now seen corresponding path program 1 times [2020-12-09 06:43:10,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:10,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524125802] [2020-12-09 06:43:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:10,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 06:43:10,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:10,959 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:10,959 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-12-09 06:43:10,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:10,970 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 06:43:10,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:43:10,972 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:10,972 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 06:43:10,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:43:10,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:43:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:13,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:13,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524125802] [2020-12-09 06:43:13,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:13,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 06:43:13,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476479666] [2020-12-09 06:43:13,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 06:43:13,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:13,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 06:43:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=63, Unknown=1, NotChecked=0, Total=90 [2020-12-09 06:43:13,195 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 10 states. [2020-12-09 06:43:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:21,825 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2020-12-09 06:43:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 06:43:21,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-09 06:43:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:21,826 INFO L225 Difference]: With dead ends: 89 [2020-12-09 06:43:21,826 INFO L226 Difference]: Without dead ends: 80 [2020-12-09 06:43:21,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=36, Invalid=94, Unknown=2, NotChecked=0, Total=132 [2020-12-09 06:43:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-09 06:43:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2020-12-09 06:43:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-09 06:43:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-12-09 06:43:21,828 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 20 [2020-12-09 06:43:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:21,828 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-12-09 06:43:21,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 06:43:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-12-09 06:43:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 06:43:21,829 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:21,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:22,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-12-09 06:43:22,030 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:22,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:22,031 INFO L82 PathProgramCache]: Analyzing trace with hash -373354461, now seen corresponding path program 1 times [2020-12-09 06:43:22,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:22,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993550704] [2020-12-09 06:43:22,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:22,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 06:43:22,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:22,145 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:22,146 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,148 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:43:22,161 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,162 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 06:43:22,162 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,164 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,164 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,164 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-12-09 06:43:22,181 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 06:43:22,181 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,193 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 06:43:22,194 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,202 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,202 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2020-12-09 06:43:22,224 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:22,225 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,236 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,236 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:26 [2020-12-09 06:43:22,289 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2020-12-09 06:43:22,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,326 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,326 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 69 [2020-12-09 06:43:22,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:43:22,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:43:22,328 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,344 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,344 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:28 [2020-12-09 06:43:22,407 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2020-12-09 06:43:22,408 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,417 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:22,417 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2020-12-09 06:43:22,497 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,497 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-12-09 06:43:22,498 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 06:43:22,500 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,501 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,501 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2020-12-09 06:43:22,557 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:22,557 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2020-12-09 06:43:22,558 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:22,570 INFO L625 ElimStorePlain]: treesize reduction 14, result has 48.1 percent of original size [2020-12-09 06:43:22,571 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:22,571 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-12-09 06:43:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:22,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:22,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993550704] [2020-12-09 06:43:22,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:22,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-09 06:43:22,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432040455] [2020-12-09 06:43:22,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 06:43:22,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:22,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 06:43:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-12-09 06:43:22,604 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 15 states. [2020-12-09 06:43:23,214 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-09 06:43:23,354 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-09 06:43:23,501 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-12-09 06:43:23,800 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-12-09 06:43:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:26,336 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2020-12-09 06:43:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 06:43:26,336 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-12-09 06:43:26,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:26,337 INFO L225 Difference]: With dead ends: 158 [2020-12-09 06:43:26,337 INFO L226 Difference]: Without dead ends: 158 [2020-12-09 06:43:26,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2020-12-09 06:43:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-09 06:43:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 69. [2020-12-09 06:43:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-09 06:43:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-12-09 06:43:26,339 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 23 [2020-12-09 06:43:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:26,339 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-12-09 06:43:26,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 06:43:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-12-09 06:43:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 06:43:26,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:26,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:26,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 06:43:26,541 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:26,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:26,542 INFO L82 PathProgramCache]: Analyzing trace with hash -373354460, now seen corresponding path program 1 times [2020-12-09 06:43:26,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:26,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349016743] [2020-12-09 06:43:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:26,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-09 06:43:26,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:26,654 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:26,655 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,657 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:43:26,671 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,672 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 06:43:26,672 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,675 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,675 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-12-09 06:43:26,692 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 06:43:26,692 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,706 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 06:43:26,707 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,714 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,714 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2020-12-09 06:43:26,764 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:26,764 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,786 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:26,787 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,800 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,801 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,801 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:34 [2020-12-09 06:43:26,894 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,895 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 73 [2020-12-09 06:43:26,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 06:43:26,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:43:26,897 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,916 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2020-12-09 06:43:26,917 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:26,930 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:26,930 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:60 [2020-12-09 06:43:27,097 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 49 [2020-12-09 06:43:27,099 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:27,113 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:27,123 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:27,123 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2020-12-09 06:43:27,124 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 06:43:27,125 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:27,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:27,131 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:27,131 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:14 [2020-12-09 06:43:27,202 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:27,202 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 06:43:27,203 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:27,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:27,215 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 06:43:27,216 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:27,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:27,226 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:27,226 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2020-12-09 06:43:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:27,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:27,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349016743] [2020-12-09 06:43:27,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:27,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-09 06:43:27,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457015961] [2020-12-09 06:43:27,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 06:43:27,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:27,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 06:43:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-12-09 06:43:27,259 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2020-12-09 06:43:28,032 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2020-12-09 06:43:28,295 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-12-09 06:43:28,620 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-12-09 06:43:28,990 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-12-09 06:43:29,294 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2020-12-09 06:43:29,661 WARN L197 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2020-12-09 06:43:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:32,456 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2020-12-09 06:43:32,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 06:43:32,457 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2020-12-09 06:43:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:32,458 INFO L225 Difference]: With dead ends: 156 [2020-12-09 06:43:32,458 INFO L226 Difference]: Without dead ends: 156 [2020-12-09 06:43:32,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 06:43:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-12-09 06:43:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 68. [2020-12-09 06:43:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 06:43:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2020-12-09 06:43:32,461 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 23 [2020-12-09 06:43:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:32,462 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2020-12-09 06:43:32,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 06:43:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2020-12-09 06:43:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 06:43:32,462 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:32,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:32,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 06:43:32,663 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:32,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1310912225, now seen corresponding path program 1 times [2020-12-09 06:43:32,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:32,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492424099] [2020-12-09 06:43:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:32,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:43:32,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:32,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:32,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492424099] [2020-12-09 06:43:32,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:32,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:32,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035524739] [2020-12-09 06:43:32,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:32,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:32,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:32,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:32,765 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 4 states. [2020-12-09 06:43:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:32,808 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2020-12-09 06:43:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:43:32,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 06:43:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:32,809 INFO L225 Difference]: With dead ends: 111 [2020-12-09 06:43:32,809 INFO L226 Difference]: Without dead ends: 111 [2020-12-09 06:43:32,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-12-09 06:43:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 70. [2020-12-09 06:43:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-09 06:43:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-12-09 06:43:32,811 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 24 [2020-12-09 06:43:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:32,811 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-12-09 06:43:32,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-12-09 06:43:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 06:43:32,811 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:32,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:33,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-12-09 06:43:33,012 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1312759267, now seen corresponding path program 1 times [2020-12-09 06:43:33,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:33,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085540913] [2020-12-09 06:43:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:33,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:43:33,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:33,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:33,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085540913] [2020-12-09 06:43:33,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:33,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:43:33,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455810872] [2020-12-09 06:43:33,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:33,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:33,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:33,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:33,212 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 4 states. [2020-12-09 06:43:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:33,316 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2020-12-09 06:43:33,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:43:33,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 06:43:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:33,317 INFO L225 Difference]: With dead ends: 88 [2020-12-09 06:43:33,317 INFO L226 Difference]: Without dead ends: 88 [2020-12-09 06:43:33,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-12-09 06:43:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2020-12-09 06:43:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 06:43:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2020-12-09 06:43:33,319 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 24 [2020-12-09 06:43:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:33,319 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2020-12-09 06:43:33,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2020-12-09 06:43:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 06:43:33,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:33,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:33,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-12-09 06:43:33,521 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1312759268, now seen corresponding path program 1 times [2020-12-09 06:43:33,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:33,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241149948] [2020-12-09 06:43:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:33,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 06:43:33,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:33,656 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:33,656 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:33,663 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:33,665 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:33,666 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:33,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:33,671 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:33,671 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 06:43:33,704 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:33,704 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 06:43:33,705 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:33,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:33,717 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 06:43:33,718 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:33,728 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:33,729 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:33,729 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 06:43:33,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:43:33,749 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 06:43:33,750 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:33,760 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:33,767 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:33,768 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 06:43:33,768 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:33,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:33,779 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:33,779 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:11 [2020-12-09 06:43:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:33,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:33,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241149948] [2020-12-09 06:43:33,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:33,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 06:43:33,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91673341] [2020-12-09 06:43:33,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 06:43:33,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 06:43:33,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:43:33,814 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2020-12-09 06:43:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:34,207 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2020-12-09 06:43:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 06:43:34,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-09 06:43:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:34,208 INFO L225 Difference]: With dead ends: 126 [2020-12-09 06:43:34,209 INFO L226 Difference]: Without dead ends: 126 [2020-12-09 06:43:34,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:43:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-12-09 06:43:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 70. [2020-12-09 06:43:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-09 06:43:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-12-09 06:43:34,210 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 24 [2020-12-09 06:43:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:34,210 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-12-09 06:43:34,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 06:43:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-12-09 06:43:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 06:43:34,211 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:34,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:34,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-12-09 06:43:34,412 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:34,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1983617125, now seen corresponding path program 1 times [2020-12-09 06:43:34,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:34,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73569397] [2020-12-09 06:43:34,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:34,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 06:43:34,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:34,573 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:34,574 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,585 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:34,585 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,592 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,592 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 06:43:34,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 06:43:34,620 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-09 06:43:34,621 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,644 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,644 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-09 06:43:34,645 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,656 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,656 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-09 06:43:34,684 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,684 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 06:43:34,685 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,697 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,700 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-09 06:43:34,700 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,712 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,712 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2020-12-09 06:43:34,762 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,762 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 06:43:34,763 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,779 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-09 06:43:34,780 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:34,790 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:34,791 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2020-12-09 06:43:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:34,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:34,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73569397] [2020-12-09 06:43:34,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:34,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 06:43:34,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184219352] [2020-12-09 06:43:34,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 06:43:34,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 06:43:34,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-09 06:43:34,819 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 9 states. [2020-12-09 06:43:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:35,186 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2020-12-09 06:43:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:43:35,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-12-09 06:43:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:35,188 INFO L225 Difference]: With dead ends: 89 [2020-12-09 06:43:35,188 INFO L226 Difference]: Without dead ends: 89 [2020-12-09 06:43:35,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-12-09 06:43:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-09 06:43:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2020-12-09 06:43:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-09 06:43:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2020-12-09 06:43:35,190 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 25 [2020-12-09 06:43:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:35,190 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2020-12-09 06:43:35,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 06:43:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2020-12-09 06:43:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 06:43:35,191 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:35,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:35,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2020-12-09 06:43:35,392 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:35,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1362588745, now seen corresponding path program 1 times [2020-12-09 06:43:35,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:35,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064404061] [2020-12-09 06:43:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:35,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:43:35,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:35,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:35,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064404061] [2020-12-09 06:43:35,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:35,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:43:35,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017543029] [2020-12-09 06:43:35,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:35,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:35,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:35,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:35,502 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 4 states. [2020-12-09 06:43:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:35,532 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-12-09 06:43:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:43:35,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-12-09 06:43:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:35,533 INFO L225 Difference]: With dead ends: 65 [2020-12-09 06:43:35,533 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 06:43:35,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 06:43:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-12-09 06:43:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 06:43:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-12-09 06:43:35,535 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 26 [2020-12-09 06:43:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:35,535 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-12-09 06:43:35,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-12-09 06:43:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 06:43:35,535 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:35,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:35,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-12-09 06:43:35,736 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:35,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:35,737 INFO L82 PathProgramCache]: Analyzing trace with hash -709421756, now seen corresponding path program 1 times [2020-12-09 06:43:35,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:35,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234800848] [2020-12-09 06:43:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:35,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 06:43:35,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:35,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:35,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234800848] [2020-12-09 06:43:35,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:35,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:35,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491463280] [2020-12-09 06:43:35,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:43:35,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:43:35,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:43:35,971 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 6 states. [2020-12-09 06:43:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:36,077 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2020-12-09 06:43:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:43:36,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-12-09 06:43:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:36,078 INFO L225 Difference]: With dead ends: 64 [2020-12-09 06:43:36,078 INFO L226 Difference]: Without dead ends: 64 [2020-12-09 06:43:36,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:43:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-09 06:43:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-12-09 06:43:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 06:43:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-12-09 06:43:36,080 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 27 [2020-12-09 06:43:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:36,080 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-12-09 06:43:36,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:43:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-12-09 06:43:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 06:43:36,080 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:36,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:36,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-12-09 06:43:36,281 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1560815527, now seen corresponding path program 1 times [2020-12-09 06:43:36,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:36,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567938401] [2020-12-09 06:43:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:36,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 06:43:36,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:36,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:36,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567938401] [2020-12-09 06:43:36,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:36,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:36,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748005756] [2020-12-09 06:43:36,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:43:36,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:36,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:43:36,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:36,417 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 5 states. [2020-12-09 06:43:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:36,544 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2020-12-09 06:43:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:43:36,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-12-09 06:43:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:36,545 INFO L225 Difference]: With dead ends: 89 [2020-12-09 06:43:36,545 INFO L226 Difference]: Without dead ends: 89 [2020-12-09 06:43:36,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:43:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-09 06:43:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2020-12-09 06:43:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-09 06:43:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-12-09 06:43:36,547 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 27 [2020-12-09 06:43:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:36,547 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-12-09 06:43:36,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:43:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-12-09 06:43:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 06:43:36,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:36,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:36,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-12-09 06:43:36,748 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1560815526, now seen corresponding path program 1 times [2020-12-09 06:43:36,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:36,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726583753] [2020-12-09 06:43:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:36,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-09 06:43:36,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:36,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:36,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726583753] [2020-12-09 06:43:36,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:36,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 06:43:36,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353196499] [2020-12-09 06:43:36,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 06:43:36,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 06:43:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:43:36,899 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 8 states. [2020-12-09 06:43:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:37,087 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-12-09 06:43:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 06:43:37,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-12-09 06:43:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:37,088 INFO L225 Difference]: With dead ends: 65 [2020-12-09 06:43:37,088 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 06:43:37,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:43:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 06:43:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-12-09 06:43:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 06:43:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-12-09 06:43:37,090 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 27 [2020-12-09 06:43:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:37,090 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-12-09 06:43:37,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 06:43:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-12-09 06:43:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 06:43:37,090 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:37,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:37,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2020-12-09 06:43:37,292 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:37,293 INFO L82 PathProgramCache]: Analyzing trace with hash -517237845, now seen corresponding path program 1 times [2020-12-09 06:43:37,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:37,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279824889] [2020-12-09 06:43:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:37,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:43:37,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:37,404 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:37,404 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:37,405 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:37,406 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:37,406 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:43:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:37,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:37,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279824889] [2020-12-09 06:43:37,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:37,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:43:37,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262595003] [2020-12-09 06:43:37,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:37,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:37,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:37,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:37,417 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 4 states. [2020-12-09 06:43:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:37,530 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2020-12-09 06:43:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:43:37,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-12-09 06:43:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:37,530 INFO L225 Difference]: With dead ends: 71 [2020-12-09 06:43:37,530 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 06:43:37,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 06:43:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-09 06:43:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 06:43:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-12-09 06:43:37,532 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2020-12-09 06:43:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:37,532 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-12-09 06:43:37,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2020-12-09 06:43:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 06:43:37,532 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:37,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:37,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2020-12-09 06:43:37,734 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash 162820525, now seen corresponding path program 1 times [2020-12-09 06:43:37,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:37,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381461118] [2020-12-09 06:43:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:37,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 06:43:37,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:37,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:37,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381461118] [2020-12-09 06:43:37,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:37,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:37,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753902566] [2020-12-09 06:43:37,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:37,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:37,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:37,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:37,969 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 4 states. [2020-12-09 06:43:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:38,010 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2020-12-09 06:43:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:43:38,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-12-09 06:43:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:38,011 INFO L225 Difference]: With dead ends: 90 [2020-12-09 06:43:38,011 INFO L226 Difference]: Without dead ends: 90 [2020-12-09 06:43:38,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-12-09 06:43:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2020-12-09 06:43:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 06:43:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-12-09 06:43:38,013 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 28 [2020-12-09 06:43:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:38,013 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-12-09 06:43:38,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-12-09 06:43:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 06:43:38,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:38,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:38,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2020-12-09 06:43:38,214 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1150641166, now seen corresponding path program 1 times [2020-12-09 06:43:38,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:38,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673542853] [2020-12-09 06:43:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:38,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 06:43:38,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:38,384 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:38,384 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-12-09 06:43:38,385 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:38,392 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:38,393 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:38,393 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2020-12-09 06:43:38,455 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2020-12-09 06:43:38,456 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:38,465 INFO L625 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2020-12-09 06:43:38,465 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:38,465 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2020-12-09 06:43:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:38,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:38,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673542853] [2020-12-09 06:43:38,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:38,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 06:43:38,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955489782] [2020-12-09 06:43:38,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 06:43:38,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:38,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 06:43:38,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:43:38,501 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 10 states. [2020-12-09 06:43:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:48,865 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2020-12-09 06:43:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:43:48,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2020-12-09 06:43:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:48,866 INFO L225 Difference]: With dead ends: 85 [2020-12-09 06:43:48,866 INFO L226 Difference]: Without dead ends: 85 [2020-12-09 06:43:48,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-12-09 06:43:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-12-09 06:43:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2020-12-09 06:43:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 06:43:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2020-12-09 06:43:48,868 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 30 [2020-12-09 06:43:48,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:48,868 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2020-12-09 06:43:48,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 06:43:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2020-12-09 06:43:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 06:43:48,868 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:48,868 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:49,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2020-12-09 06:43:49,070 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash -775819286, now seen corresponding path program 1 times [2020-12-09 06:43:49,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:49,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252179316] [2020-12-09 06:43:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:49,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 47 conjunts are in the unsatisfiable core [2020-12-09 06:43:49,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:49,425 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:43:49,425 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:49,436 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:49,440 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:43:49,440 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:49,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:49,448 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:49,448 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2020-12-09 06:43:49,490 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-09 06:43:49,490 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:49,496 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:49,498 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-09 06:43:49,498 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:49,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:49,502 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:49,502 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-12-09 06:43:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:49,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:49,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252179316] [2020-12-09 06:43:49,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:49,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 06:43:49,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201802646] [2020-12-09 06:43:49,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 06:43:49,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:49,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 06:43:49,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-12-09 06:43:49,557 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 12 states. [2020-12-09 06:43:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:50,115 INFO L93 Difference]: Finished difference Result 99 states and 98 transitions. [2020-12-09 06:43:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 06:43:50,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-12-09 06:43:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:50,117 INFO L225 Difference]: With dead ends: 99 [2020-12-09 06:43:50,117 INFO L226 Difference]: Without dead ends: 99 [2020-12-09 06:43:50,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2020-12-09 06:43:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-12-09 06:43:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2020-12-09 06:43:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-09 06:43:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-12-09 06:43:50,118 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 32 [2020-12-09 06:43:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:50,118 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-12-09 06:43:50,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 06:43:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-12-09 06:43:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 06:43:50,119 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:50,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:50,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2020-12-09 06:43:50,320 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:50,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash -775819029, now seen corresponding path program 1 times [2020-12-09 06:43:50,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:50,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963941538] [2020-12-09 06:43:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:50,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:43:50,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:50,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:50,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963941538] [2020-12-09 06:43:50,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:50,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:43:50,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237982541] [2020-12-09 06:43:50,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:50,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:50,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:50,456 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 4 states. [2020-12-09 06:43:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:50,486 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-12-09 06:43:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:43:50,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-09 06:43:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:50,486 INFO L225 Difference]: With dead ends: 66 [2020-12-09 06:43:50,486 INFO L226 Difference]: Without dead ends: 66 [2020-12-09 06:43:50,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-12-09 06:43:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-12-09 06:43:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-09 06:43:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-12-09 06:43:50,488 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 32 [2020-12-09 06:43:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:50,488 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-12-09 06:43:50,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-12-09 06:43:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 06:43:50,488 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:50,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:50,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2020-12-09 06:43:50,690 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1719414022, now seen corresponding path program 1 times [2020-12-09 06:43:50,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:50,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875699969] [2020-12-09 06:43:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:50,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 06:43:50,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:50,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:50,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875699969] [2020-12-09 06:43:50,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:50,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:43:50,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181637695] [2020-12-09 06:43:50,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:43:50,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:43:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:43:50,901 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 6 states. [2020-12-09 06:43:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:51,002 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2020-12-09 06:43:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:43:51,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-12-09 06:43:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:51,003 INFO L225 Difference]: With dead ends: 65 [2020-12-09 06:43:51,003 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 06:43:51,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:43:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 06:43:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-12-09 06:43:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 06:43:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-12-09 06:43:51,005 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 33 [2020-12-09 06:43:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:51,005 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-12-09 06:43:51,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:43:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-12-09 06:43:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 06:43:51,005 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:51,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:51,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2020-12-09 06:43:51,206 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1762227277, now seen corresponding path program 1 times [2020-12-09 06:43:51,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:51,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175971140] [2020-12-09 06:43:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:51,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:43:51,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:51,485 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 06:43:51,486 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:51,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:51,488 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:51,488 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 06:43:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:51,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:51,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175971140] [2020-12-09 06:43:51,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:51,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:43:51,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287009652] [2020-12-09 06:43:51,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:43:51,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:51,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:43:51,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:43:51,509 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 4 states. [2020-12-09 06:43:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:51,602 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2020-12-09 06:43:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:43:51,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-12-09 06:43:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:51,603 INFO L225 Difference]: With dead ends: 68 [2020-12-09 06:43:51,603 INFO L226 Difference]: Without dead ends: 68 [2020-12-09 06:43:51,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:43:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-09 06:43:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-09 06:43:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 06:43:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-12-09 06:43:51,605 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 34 [2020-12-09 06:43:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:51,605 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-12-09 06:43:51,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:43:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-12-09 06:43:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 06:43:51,605 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:51,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:51,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2020-12-09 06:43:51,806 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:51,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash 281046357, now seen corresponding path program 1 times [2020-12-09 06:43:51,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:51,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345463486] [2020-12-09 06:43:51,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:51,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 06:43:51,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:51,974 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:43:51,974 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:51,980 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:51,981 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:51,981 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2020-12-09 06:43:52,015 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-09 06:43:52,016 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:52,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:52,018 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 06:43:52,018 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-09 06:43:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:52,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:52,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345463486] [2020-12-09 06:43:52,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:52,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 06:43:52,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036946422] [2020-12-09 06:43:52,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 06:43:52,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:52,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 06:43:52,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-12-09 06:43:52,064 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 14 states. [2020-12-09 06:43:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:52,504 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-12-09 06:43:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 06:43:52,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-12-09 06:43:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:52,505 INFO L225 Difference]: With dead ends: 67 [2020-12-09 06:43:52,505 INFO L226 Difference]: Without dead ends: 67 [2020-12-09 06:43:52,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2020-12-09 06:43:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-09 06:43:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-12-09 06:43:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-09 06:43:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-12-09 06:43:52,507 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 35 [2020-12-09 06:43:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:52,507 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-12-09 06:43:52,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 06:43:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-12-09 06:43:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 06:43:52,507 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:52,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:52,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2020-12-09 06:43:52,708 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:52,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:52,708 INFO L82 PathProgramCache]: Analyzing trace with hash 122502611, now seen corresponding path program 1 times [2020-12-09 06:43:52,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:52,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553690700] [2020-12-09 06:43:52,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:43:52,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-09 06:43:52,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:43:53,022 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-09 06:43:53,023 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:53,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:53,039 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:53,039 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2020-12-09 06:43:53,164 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-09 06:43:53,165 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 06:43:53,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 06:43:53,174 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 06:43:53,174 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2020-12-09 06:43:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:43:53,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:43:53,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553690700] [2020-12-09 06:43:53,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:43:53,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-09 06:43:53,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97343752] [2020-12-09 06:43:53,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 06:43:53,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:43:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 06:43:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-12-09 06:43:53,344 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 16 states. [2020-12-09 06:43:54,640 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-12-09 06:43:54,823 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2020-12-09 06:43:55,000 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2020-12-09 06:43:55,324 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2020-12-09 06:43:55,560 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2020-12-09 06:43:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:43:55,790 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2020-12-09 06:43:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 06:43:55,792 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2020-12-09 06:43:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:43:55,792 INFO L225 Difference]: With dead ends: 76 [2020-12-09 06:43:55,792 INFO L226 Difference]: Without dead ends: 76 [2020-12-09 06:43:55,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2020-12-09 06:43:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-12-09 06:43:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2020-12-09 06:43:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-09 06:43:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-12-09 06:43:55,794 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 36 [2020-12-09 06:43:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:43:55,794 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-12-09 06:43:55,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 06:43:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-12-09 06:43:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 06:43:55,794 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:43:55,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:43:55,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3 [2020-12-09 06:43:55,996 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 06:43:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:43:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash -497386217, now seen corresponding path program 1 times [2020-12-09 06:43:55,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:43:55,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096534027] [2020-12-09 06:43:55,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2020-12-09 06:43:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:43:56,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:43:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:43:56,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:43:56,408 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-12-09 06:43:56,408 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 06:43:56,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 mathsat -unsat_core_generation=3 [2020-12-09 06:43:56,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:43:56 BoogieIcfgContainer [2020-12-09 06:43:56,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 06:43:56,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 06:43:56,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 06:43:56,679 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 06:43:56,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:42:53" (3/4) ... [2020-12-09 06:43:56,681 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 06:43:56,715 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5ff61b3c-c73a-4688-83af-4c9c3c63a177/bin/utaipan/witness.graphml [2020-12-09 06:43:56,716 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 06:43:56,716 INFO L168 Benchmark]: Toolchain (without parser) took 64685.30 ms. Allocated memory was 56.6 MB in the beginning and 104.9 MB in the end (delta: 48.2 MB). Free memory was 34.1 MB in the beginning and 81.7 MB in the end (delta: -47.6 MB). Peak memory consumption was 59.5 MB. Max. memory is 16.1 GB. [2020-12-09 06:43:56,716 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 38.9 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:43:56,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.82 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 33.9 MB in the beginning and 39.7 MB in the end (delta: -5.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 06:43:56,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.79 ms. Allocated memory is still 71.3 MB. Free memory was 39.7 MB in the beginning and 37.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:43:56,717 INFO L168 Benchmark]: Boogie Preprocessor took 31.57 ms. Allocated memory is still 71.3 MB. Free memory was 37.0 MB in the beginning and 35.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:43:56,717 INFO L168 Benchmark]: RCFGBuilder took 462.73 ms. Allocated memory is still 71.3 MB. Free memory was 35.0 MB in the beginning and 44.0 MB in the end (delta: -9.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. [2020-12-09 06:43:56,718 INFO L168 Benchmark]: TraceAbstraction took 63547.73 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 43.6 MB in the beginning and 26.7 MB in the end (delta: 16.9 MB). Peak memory consumption was 50.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:43:56,718 INFO L168 Benchmark]: Witness Printer took 36.35 ms. Allocated memory is still 104.9 MB. Free memory was 25.7 MB in the beginning and 81.7 MB in the end (delta: -56.0 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-12-09 06:43:56,719 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 38.9 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 549.82 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 33.9 MB in the beginning and 39.7 MB in the end (delta: -5.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.79 ms. Allocated memory is still 71.3 MB. Free memory was 39.7 MB in the beginning and 37.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.57 ms. Allocated memory is still 71.3 MB. Free memory was 37.0 MB in the beginning and 35.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 462.73 ms. Allocated memory is still 71.3 MB. Free memory was 35.0 MB in the beginning and 44.0 MB in the end (delta: -9.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 63547.73 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 43.6 MB in the beginning and 26.7 MB in the end (delta: 16.9 MB). Peak memory consumption was 50.1 MB. Max. memory is 16.1 GB. * Witness Printer took 36.35 ms. Allocated memory is still 104.9 MB. Free memory was 25.7 MB in the beginning and 81.7 MB in the end (delta: -56.0 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 799]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={263:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={263:0}] [L803] struct ldv_i2c_client *c11 = (struct ldv_i2c_client *)ldv_malloc(sizeof(struct ldv_i2c_client)); [L804] COND FALSE !(!c11) [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={263:0}] [L805-L806] struct ldv_m88ts2022_config *cfg = (struct ldv_m88ts2022_config *) ldv_malloc(sizeof(struct ldv_m88ts2022_config)); [L807] COND FALSE !(!cfg) VAL [ldv_global_msg_list={263:0}] [L808] c11->dev.platform_data = cfg VAL [ldv_global_msg_list={263:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={263:0}] [L809-L810] struct ldv_dvb_frontend *fe = (struct ldv_dvb_frontend *) ldv_malloc(sizeof(struct ldv_dvb_frontend)); [L811] COND FALSE !(!fe) VAL [ldv_global_msg_list={263:0}] [L812] cfg->fe = fe VAL [ldv_global_msg_list={263:0}] [L784] EXPR client->dev.platform_data VAL [ldv_global_msg_list={263:0}] [L784] struct ldv_m88ts2022_config *cfg = client->dev.platform_data; [L785] EXPR cfg->fe VAL [ldv_global_msg_list={263:0}] [L785] struct ldv_dvb_frontend *fe = cfg->fe; [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={263:0}] [L786] struct Data11 *priv = (struct Data11*)ldv_malloc(sizeof(struct Data11)); [L787] COND FALSE !(!priv) VAL [ldv_global_msg_list={263:0}] [L788] fe->tuner_priv = priv VAL [ldv_global_msg_list={263:0}] [L623] dev->driver_data = data VAL [ldv_global_msg_list={263:0}] [L790] free(priv) VAL [ldv_global_msg_list={263:0}] [L790] free(priv) VAL [ldv_global_msg_list={263:0}] [L790] free(priv) [L791] return 0; VAL [ldv_global_msg_list={263:0}] [L619] EXPR dev->driver_data VAL [ldv_global_msg_list={263:0}] [L619] return dev->driver_data; [L774] return ldv_dev_get_drvdata(&dev->dev); [L797] void *priv = (struct Data11*)ldv_i2c_get_clientdata(client); [L798] COND TRUE \read(*priv) VAL [ldv_global_msg_list={263:0}] [L799] free(priv) VAL [ldv_global_msg_list={263:0}] [L799] free(priv) VAL [ldv_global_msg_list={263:0}] [L799] free(priv) VAL [ldv_global_msg_list={263:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 32 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 63.4s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 41.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2327 SDtfs, 7732 SDslu, 5161 SDs, 0 SdLazy, 5337 SolverSat, 499 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 893 GetRequests, 551 SyntacticMatches, 2 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 2294 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 745 ConstructedInterpolants, 149 QuantifiedInterpolants, 142887 SizeOfPredicates, 396 NumberOfNonLiveVariables, 3770 ConjunctsInSsa, 528 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...