./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:02:03,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:02:03,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:02:03,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:02:03,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:02:03,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:02:03,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:02:03,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:02:03,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:02:03,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:02:03,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:02:03,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:02:03,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:02:03,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:02:03,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:02:03,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:02:03,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:02:03,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:02:03,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:02:03,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:02:03,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:02:03,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:02:03,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:02:03,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:02:03,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:02:03,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:02:03,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:02:03,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:02:03,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:02:03,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:02:03,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:02:03,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:02:03,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:02:03,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:02:03,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:02:03,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:02:03,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:02:03,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:02:03,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:02:03,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:02:03,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:02:03,283 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-07 01:02:03,311 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:02:03,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:02:03,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:02:03,313 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:02:03,314 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:02:03,314 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:02:03,314 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:02:03,315 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:02:03,315 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:02:03,316 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:02:03,316 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:02:03,316 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:02:03,317 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:02:03,317 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:02:03,317 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:02:03,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 01:02:03,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 01:02:03,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:02:03,320 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:02:03,320 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 01:02:03,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:02:03,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:02:03,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:02:03,321 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 01:02:03,322 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 01:02:03,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:02:03,323 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:02:03,323 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:02:03,323 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:02:03,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:02:03,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:02:03,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:02:03,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:02:03,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:02:03,326 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:02:03,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:02:03,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:02:03,327 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:02:03,327 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_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/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_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8 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-memcleanup) ) 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2021-11-07 01:02:03,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:02:03,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:02:03,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:02:03,630 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:02:03,631 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:02:03,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-11-07 01:02:03,707 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data/884c0e280/f907ab70b211456f85d2eee694beefbb/FLAG2473258e2 [2021-11-07 01:02:04,238 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:02:04,238 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-11-07 01:02:04,264 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data/884c0e280/f907ab70b211456f85d2eee694beefbb/FLAG2473258e2 [2021-11-07 01:02:04,664 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data/884c0e280/f907ab70b211456f85d2eee694beefbb [2021-11-07 01:02:04,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:02:04,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:02:04,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:02:04,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:02:04,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:02:04,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:02:04" (1/1) ... [2021-11-07 01:02:04,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69fb029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:04, skipping insertion in model container [2021-11-07 01:02:04,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:02:04" (1/1) ... [2021-11-07 01:02:04,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:02:04,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:02:05,156 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-11-07 01:02:05,170 WARN L563 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-11-07 01:02:05,171 WARN L563 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-11-07 01:02:05,172 WARN L563 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-11-07 01:02:05,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:02:05,202 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) [2021-11-07 01:02:05,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5357b418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:05, skipping insertion in model container [2021-11-07 01:02:05,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:02:05,210 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-07 01:02:05,212 INFO L168 Benchmark]: Toolchain (without parser) took 543.26 ms. Allocated memory was 81.8 MB in the beginning and 121.6 MB in the end (delta: 39.8 MB). Free memory was 45.4 MB in the beginning and 93.8 MB in the end (delta: -48.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:02:05,214 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 81.8 MB. Free memory was 51.9 MB in the beginning and 51.9 MB in the end (delta: 30.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:02:05,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.96 ms. Allocated memory was 81.8 MB in the beginning and 121.6 MB in the end (delta: 39.8 MB). Free memory was 45.3 MB in the beginning and 93.8 MB in the end (delta: -48.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:02:05,217 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.24 ms. Allocated memory is still 81.8 MB. Free memory was 51.9 MB in the beginning and 51.9 MB in the end (delta: 30.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 540.96 ms. Allocated memory was 81.8 MB in the beginning and 121.6 MB in the end (delta: 39.8 MB). Free memory was 45.3 MB in the beginning and 93.8 MB in the end (delta: -48.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:02:07,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:02:07,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:02:07,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:02:07,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:02:07,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:02:07,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:02:07,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:02:07,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:02:07,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:02:07,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:02:07,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:02:07,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:02:07,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:02:07,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:02:07,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:02:07,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:02:07,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:02:07,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:02:07,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:02:07,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:02:07,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:02:07,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:02:07,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:02:07,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:02:07,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:02:07,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:02:07,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:02:07,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:02:07,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:02:07,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:02:07,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:02:07,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:02:07,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:02:07,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:02:07,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:02:07,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:02:07,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:02:07,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:02:07,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:02:07,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:02:07,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf [2021-11-07 01:02:07,578 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:02:07,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:02:07,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:02:07,580 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:02:07,580 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:02:07,581 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:02:07,581 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:02:07,581 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:02:07,581 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:02:07,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 01:02:07,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 01:02:07,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:02:07,584 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:02:07,584 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 01:02:07,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:02:07,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:02:07,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:02:07,585 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 01:02:07,585 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 01:02:07,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:02:07,586 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:02:07,586 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 01:02:07,586 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 01:02:07,587 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:02:07,587 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:02:07,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:02:07,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 01:02:07,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:02:07,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:02:07,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:02:07,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:02:07,588 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-07 01:02:07,589 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 01:02:07,589 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:02:07,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:02:07,590 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_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/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_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8 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-memcleanup) ) 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2021-11-07 01:02:07,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:02:07,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:02:07,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:02:07,993 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:02:07,994 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:02:07,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-11-07 01:02:08,067 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data/7a106bb8c/3e1fb0b14a2b4a0cbd22ef8b6f3940e6/FLAGaae034b65 [2021-11-07 01:02:08,739 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:02:08,739 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-11-07 01:02:08,760 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data/7a106bb8c/3e1fb0b14a2b4a0cbd22ef8b6f3940e6/FLAGaae034b65 [2021-11-07 01:02:09,001 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/data/7a106bb8c/3e1fb0b14a2b4a0cbd22ef8b6f3940e6 [2021-11-07 01:02:09,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:02:09,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:02:09,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:02:09,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:02:09,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:02:09,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:09,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6a92ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09, skipping insertion in model container [2021-11-07 01:02:09,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:09,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:02:09,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:02:09,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-11-07 01:02:09,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:02:09,558 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-07 01:02:09,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:02:09,592 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-11-07 01:02:09,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:02:09,637 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:02:09,674 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-11-07 01:02:09,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:02:09,805 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:02:09,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09 WrapperNode [2021-11-07 01:02:09,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:02:09,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:02:09,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:02:09,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:02:09,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:09,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:09,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:02:09,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:02:09,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:02:09,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:02:09,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:09,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:09,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:09,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:10,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:10,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:10,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:10,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:02:10,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:02:10,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:02:10,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:02:10,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (1/1) ... [2021-11-07 01:02:10,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:02:10,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:02:10,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:02:10,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:02:10,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-07 01:02:10,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:02:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 01:02:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:02:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-07 01:02:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 01:02:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 01:02:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 01:02:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 01:02:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:02:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:02:11,522 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:02:11,523 INFO L299 CfgBuilder]: Removed 178 assume(true) statements. [2021-11-07 01:02:11,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:02:11 BoogieIcfgContainer [2021-11-07 01:02:11,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:02:11,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:02:11,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:02:11,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:02:11,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:02:09" (1/3) ... [2021-11-07 01:02:11,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3956d05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:02:11, skipping insertion in model container [2021-11-07 01:02:11,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:02:09" (2/3) ... [2021-11-07 01:02:11,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3956d05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:02:11, skipping insertion in model container [2021-11-07 01:02:11,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:02:11" (3/3) ... [2021-11-07 01:02:11,537 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2021-11-07 01:02:11,542 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:02:11,543 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 146 error locations. [2021-11-07 01:02:11,585 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:02:11,589 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:02:11,590 INFO L340 AbstractCegarLoop]: Starting to check reachability of 146 error locations. [2021-11-07 01:02:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 353 states, 206 states have (on average 2.2815533980582523) internal successors, (470), 352 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-07 01:02:11,633 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:11,634 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-07 01:02:11,635 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:02:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash 28694792, now seen corresponding path program 1 times [2021-11-07 01:02:11,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:02:11,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212783855] [2021-11-07 01:02:11,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:11,658 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:02:11,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:02:11,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:02:11,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 01:02:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:11,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-07 01:02:11,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:02:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:11,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:02:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:11,854 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:02:11,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212783855] [2021-11-07 01:02:11,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212783855] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:11,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:11,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-07 01:02:11,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200454967] [2021-11-07 01:02:11,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 01:02:11,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:02:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 01:02:11,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 01:02:11,897 INFO L87 Difference]: Start difference. First operand has 353 states, 206 states have (on average 2.2815533980582523) internal successors, (470), 352 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:11,928 INFO L93 Difference]: Finished difference Result 345 states and 351 transitions. [2021-11-07 01:02:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 01:02:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-07 01:02:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:11,941 INFO L225 Difference]: With dead ends: 345 [2021-11-07 01:02:11,941 INFO L226 Difference]: Without dead ends: 343 [2021-11-07 01:02:11,943 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 01:02:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-11-07 01:02:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-11-07 01:02:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 201 states have (on average 1.736318407960199) internal successors, (349), 342 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 349 transitions. [2021-11-07 01:02:11,997 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 349 transitions. Word has length 5 [2021-11-07 01:02:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:11,998 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 349 transitions. [2021-11-07 01:02:11,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 349 transitions. [2021-11-07 01:02:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-07 01:02:11,998 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:11,999 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-07 01:02:12,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:02:12,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:02:12,212 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:02:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash 28694854, now seen corresponding path program 1 times [2021-11-07 01:02:12,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:02:12,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835533031] [2021-11-07 01:02:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:12,215 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:02:12,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:02:12,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:02:12,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 01:02:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:12,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:02:12,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:02:12,379 INFO L388 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 [2021-11-07 01:02:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:12,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:02:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:12,456 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:02:12,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835533031] [2021-11-07 01:02:12,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835533031] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:12,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:12,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-07 01:02:12,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094510024] [2021-11-07 01:02:12,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:02:12,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:02:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:02:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:02:12,460 INFO L87 Difference]: Start difference. First operand 343 states and 349 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:12,866 INFO L93 Difference]: Finished difference Result 362 states and 368 transitions. [2021-11-07 01:02:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:02:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-07 01:02:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:12,870 INFO L225 Difference]: With dead ends: 362 [2021-11-07 01:02:12,870 INFO L226 Difference]: Without dead ends: 362 [2021-11-07 01:02:12,871 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:02:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-11-07 01:02:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 340. [2021-11-07 01:02:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 201 states have (on average 1.7213930348258706) internal successors, (346), 339 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 346 transitions. [2021-11-07 01:02:12,905 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 346 transitions. Word has length 5 [2021-11-07 01:02:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:12,906 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 346 transitions. [2021-11-07 01:02:12,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 346 transitions. [2021-11-07 01:02:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-07 01:02:12,906 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:12,910 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-07 01:02:12,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-07 01:02:13,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:02:13,111 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:02:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 28694855, now seen corresponding path program 1 times [2021-11-07 01:02:13,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:02:13,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150651754] [2021-11-07 01:02:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:13,113 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:02:13,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:02:13,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:02:13,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 01:02:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:13,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 01:02:13,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:02:13,208 INFO L388 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 [2021-11-07 01:02:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:13,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:02:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:13,310 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:02:13,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150651754] [2021-11-07 01:02:13,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150651754] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:13,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:13,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-07 01:02:13,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577331183] [2021-11-07 01:02:13,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:02:13,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:02:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:02:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:02:13,313 INFO L87 Difference]: Start difference. First operand 340 states and 346 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:13,763 INFO L93 Difference]: Finished difference Result 338 states and 344 transitions. [2021-11-07 01:02:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:02:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-07 01:02:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:13,766 INFO L225 Difference]: With dead ends: 338 [2021-11-07 01:02:13,767 INFO L226 Difference]: Without dead ends: 338 [2021-11-07 01:02:13,767 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:02:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-11-07 01:02:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2021-11-07 01:02:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 201 states have (on average 1.7064676616915422) internal successors, (343), 336 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 343 transitions. [2021-11-07 01:02:13,783 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 343 transitions. Word has length 5 [2021-11-07 01:02:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:13,784 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 343 transitions. [2021-11-07 01:02:13,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 343 transitions. [2021-11-07 01:02:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:02:13,784 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:13,785 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:13,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-07 01:02:13,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:02:13,998 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:02:13,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:13,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1805950471, now seen corresponding path program 1 times [2021-11-07 01:02:14,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:02:14,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223856945] [2021-11-07 01:02:14,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:14,000 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:02:14,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:02:14,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:02:14,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 01:02:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:14,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 01:02:14,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:02:14,186 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-07 01:02:14,186 INFO L388 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 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-07 01:02:14,461 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-07 01:02:14,461 INFO L388 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 21 treesize of output 28 [2021-11-07 01:02:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:14,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:02:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:16,763 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:02:16,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223856945] [2021-11-07 01:02:16,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223856945] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:16,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:16,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-07 01:02:16,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661203889] [2021-11-07 01:02:16,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:02:16,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:02:16,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:02:16,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2021-11-07 01:02:16,766 INFO L87 Difference]: Start difference. First operand 337 states and 343 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:17,421 INFO L93 Difference]: Finished difference Result 357 states and 363 transitions. [2021-11-07 01:02:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:02:17,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-07 01:02:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:17,424 INFO L225 Difference]: With dead ends: 357 [2021-11-07 01:02:17,424 INFO L226 Difference]: Without dead ends: 357 [2021-11-07 01:02:17,424 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2021-11-07 01:02:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-07 01:02:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 335. [2021-11-07 01:02:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 202 states have (on average 1.693069306930693) internal successors, (342), 334 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 342 transitions. [2021-11-07 01:02:17,457 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 342 transitions. Word has length 7 [2021-11-07 01:02:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:17,458 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 342 transitions. [2021-11-07 01:02:17,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 342 transitions. [2021-11-07 01:02:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:02:17,460 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:17,460 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:17,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:02:17,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:02:17,666 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:02:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1805950472, now seen corresponding path program 1 times [2021-11-07 01:02:17,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:02:17,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789163651] [2021-11-07 01:02:17,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:17,667 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:02:17,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:02:17,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:02:17,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 01:02:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:17,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 01:02:17,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:02:17,856 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-07 01:02:17,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2021-11-07 01:02:17,929 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-07 01:02:17,929 INFO L388 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 3 case distinctions, treesize of input 42 treesize of output 63 [2021-11-07 01:02:18,196 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-07 01:02:18,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 53 [2021-11-07 01:02:18,234 INFO L354 Elim1Store]: treesize reduction 2, result has 92.0 percent of original size [2021-11-07 01:02:18,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 66 [2021-11-07 01:02:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:18,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:02:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:23,376 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:02:23,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789163651] [2021-11-07 01:02:23,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789163651] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:23,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:23,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2021-11-07 01:02:23,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158526907] [2021-11-07 01:02:23,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:02:23,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:02:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:02:23,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=36, Unknown=2, NotChecked=0, Total=56 [2021-11-07 01:02:23,378 INFO L87 Difference]: Start difference. First operand 335 states and 342 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:25,087 INFO L93 Difference]: Finished difference Result 539 states and 549 transitions. [2021-11-07 01:02:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:02:25,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-07 01:02:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:25,091 INFO L225 Difference]: With dead ends: 539 [2021-11-07 01:02:25,091 INFO L226 Difference]: Without dead ends: 539 [2021-11-07 01:02:25,092 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=59, Invalid=95, Unknown=2, NotChecked=0, Total=156 [2021-11-07 01:02:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-11-07 01:02:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 331. [2021-11-07 01:02:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 202 states have (on average 1.6683168316831682) internal successors, (337), 330 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 337 transitions. [2021-11-07 01:02:25,101 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 337 transitions. Word has length 7 [2021-11-07 01:02:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:25,101 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 337 transitions. [2021-11-07 01:02:25,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 337 transitions. [2021-11-07 01:02:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:02:25,102 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:25,102 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:25,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-07 01:02:25,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:02:25,322 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:02:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 351614728, now seen corresponding path program 1 times [2021-11-07 01:02:25,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:02:25,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379783681] [2021-11-07 01:02:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:25,324 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:02:25,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:02:25,325 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:02:25,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-07 01:02:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:25,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-07 01:02:25,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:02:25,581 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-07 01:02:25,581 INFO L388 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 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-07 01:02:25,845 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-07 01:02:25,845 INFO L388 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 16 treesize of output 16 [2021-11-07 01:02:25,958 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-11-07 01:02:25,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 15 [2021-11-07 01:02:26,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-11-07 01:02:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:26,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:02:26,103 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-11-07 01:02:26,103 INFO L388 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 22 treesize of output 21 [2021-11-07 01:02:26,126 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:02:26,128 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-11-07 01:02:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:38,181 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:02:38,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379783681] [2021-11-07 01:02:38,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379783681] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:02:38,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:02:38,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-07 01:02:38,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863617016] [2021-11-07 01:02:38,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 01:02:38,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:02:38,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 01:02:38,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=63, Unknown=5, NotChecked=0, Total=90 [2021-11-07 01:02:38,184 INFO L87 Difference]: Start difference. First operand 331 states and 337 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:02:42,360 INFO L93 Difference]: Finished difference Result 365 states and 371 transitions. [2021-11-07 01:02:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:02:42,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-07 01:02:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:02:42,363 INFO L225 Difference]: With dead ends: 365 [2021-11-07 01:02:42,363 INFO L226 Difference]: Without dead ends: 365 [2021-11-07 01:02:42,363 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=67, Invalid=137, Unknown=6, NotChecked=0, Total=210 [2021-11-07 01:02:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-07 01:02:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2021-11-07 01:02:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 209 states have (on average 1.6507177033492824) internal successors, (345), 337 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 345 transitions. [2021-11-07 01:02:42,371 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 345 transitions. Word has length 9 [2021-11-07 01:02:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:02:42,372 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 345 transitions. [2021-11-07 01:02:42,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:02:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 345 transitions. [2021-11-07 01:02:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:02:42,373 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:02:42,373 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:02:42,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-07 01:02:42,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:02:42,597 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:02:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:02:42,597 INFO L85 PathProgramCache]: Analyzing trace with hash 351614729, now seen corresponding path program 1 times [2021-11-07 01:02:42,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:02:42,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828319380] [2021-11-07 01:02:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:02:42,598 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:02:42,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:02:42,599 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:02:42,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-07 01:02:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:02:42,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-07 01:02:42,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:02:42,805 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-07 01:02:42,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2021-11-07 01:02:42,884 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-07 01:02:42,885 INFO L388 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 3 case distinctions, treesize of input 42 treesize of output 63 [2021-11-07 01:02:43,207 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-07 01:02:43,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 52 [2021-11-07 01:02:43,243 INFO L354 Elim1Store]: treesize reduction 2, result has 92.0 percent of original size [2021-11-07 01:02:43,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 65 [2021-11-07 01:02:43,734 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-11-07 01:02:43,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 71 [2021-11-07 01:02:43,812 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-11-07 01:02:43,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 23 [2021-11-07 01:02:43,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-11-07 01:02:43,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-11-07 01:02:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:02:44,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:02:44,428 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:02:44,430 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 186 [2021-11-07 01:02:44,445 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:02:44,447 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 288 [2021-11-07 01:02:59,529 WARN L207 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 47 [2021-11-07 01:03:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:14,450 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:03:14,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828319380] [2021-11-07 01:03:14,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828319380] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:14,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:14,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-07 01:03:14,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159389212] [2021-11-07 01:03:14,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:03:14,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:03:14,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:03:14,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=144, Unknown=4, NotChecked=0, Total=182 [2021-11-07 01:03:14,452 INFO L87 Difference]: Start difference. First operand 338 states and 345 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:17,517 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_list_add_~head.base) c_ULTIMATE.start_list_add_~head.offset))) (let ((.cse4 (bvadd (_ bv8 32) .cse3)) (.cse7 (bvadd .cse6 (_ bv8 32)))) (and (= (select |c_#length| c_ULTIMATE.start___list_add_~next.base) (_ bv8 32)) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32))) (.cse1 (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset)) (.cse2 (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_gl_insert_~node~1.base) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_9) .cse0 v_DerPreprocessor_10) .cse1 v_DerPreprocessor_11) .cse2 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6) .cse1 v_DerPreprocessor_7) .cse2 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) (= (_ bv8 32) (select |c_#length| |c_ULTIMATE.start_list_add_#t~mem48.base|)) (bvule (bvadd (_ bv4 32) .cse3) .cse4) (bvule .cse4 (select |c_#length| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_list_add_~head.base) c_ULTIMATE.start_list_add_~head.offset))) (= |c_ULTIMATE.start_list_add_#t~mem48.offset| (_ bv0 32)) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_gl_insert_~node~1.base) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse5) (bvadd (_ bv8 32) .cse5)))) (bvule (bvadd (_ bv4 32) .cse6) .cse7) (exists ((ULTIMATE.start_gl_insert_~node~1.base (_ BitVec 32))) (= (select |c_#length| ULTIMATE.start_gl_insert_~node~1.base) (_ bv20 32))) (= c_ULTIMATE.start___list_add_~next.offset (_ bv0 32)) (bvule .cse7 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (forall ((v_ULTIMATE.start_gl_insert_~node~1.base_20 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse8 (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32))) (.cse9 (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset)) (.cse10 (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_gl_insert_~node~1.base_20) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_9) .cse8 v_DerPreprocessor_10) .cse9 v_DerPreprocessor_11) .cse10 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| v_ULTIMATE.start_gl_insert_~node~1.base_20 (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_20) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_5) .cse8 v_DerPreprocessor_6) .cse9 v_DerPreprocessor_7) .cse10 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_gl_insert_~node~1.base_20) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse11) (bvadd (_ bv8 32) .cse11))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_20))))))))) is different from false [2021-11-07 01:03:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:53,302 INFO L93 Difference]: Finished difference Result 646 states and 658 transitions. [2021-11-07 01:03:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:03:53,303 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-07 01:03:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:53,307 INFO L225 Difference]: With dead ends: 646 [2021-11-07 01:03:53,307 INFO L226 Difference]: Without dead ends: 646 [2021-11-07 01:03:53,307 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=86, Invalid=219, Unknown=5, NotChecked=32, Total=342 [2021-11-07 01:03:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2021-11-07 01:03:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 338. [2021-11-07 01:03:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 209 states have (on average 1.645933014354067) internal successors, (344), 337 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 344 transitions. [2021-11-07 01:03:53,317 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 344 transitions. Word has length 9 [2021-11-07 01:03:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:53,318 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 344 transitions. [2021-11-07 01:03:53,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 344 transitions. [2021-11-07 01:03:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:03:53,318 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:53,319 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:53,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-07 01:03:53,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:03:53,527 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:03:53,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:53,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1984845326, now seen corresponding path program 1 times [2021-11-07 01:03:53,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:03:53,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773247112] [2021-11-07 01:03:53,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:53,528 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:03:53,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:03:53,529 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:03:53,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-07 01:03:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:53,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 01:03:53,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:53,656 INFO L388 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 [2021-11-07 01:03:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:53,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:53,781 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:03:53,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773247112] [2021-11-07 01:03:53,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773247112] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:53,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:53,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-07 01:03:53,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143718851] [2021-11-07 01:03:53,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:03:53,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:03:53,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:03:53,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:03:53,783 INFO L87 Difference]: Start difference. First operand 338 states and 344 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:54,510 INFO L93 Difference]: Finished difference Result 521 states and 531 transitions. [2021-11-07 01:03:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:03:54,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 01:03:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:54,513 INFO L225 Difference]: With dead ends: 521 [2021-11-07 01:03:54,514 INFO L226 Difference]: Without dead ends: 521 [2021-11-07 01:03:54,514 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:03:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-11-07 01:03:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 335. [2021-11-07 01:03:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 209 states have (on average 1.631578947368421) internal successors, (341), 334 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 341 transitions. [2021-11-07 01:03:54,525 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 341 transitions. Word has length 10 [2021-11-07 01:03:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:54,526 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 341 transitions. [2021-11-07 01:03:54,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 341 transitions. [2021-11-07 01:03:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:03:54,526 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:54,527 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:54,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-07 01:03:54,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:03:54,738 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:03:54,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1984845325, now seen corresponding path program 1 times [2021-11-07 01:03:54,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:03:54,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433849658] [2021-11-07 01:03:54,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:54,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:03:54,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:03:54,740 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:03:54,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-07 01:03:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:54,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-07 01:03:54,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:54,875 INFO L388 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 [2021-11-07 01:03:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:54,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:55,297 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:03:55,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433849658] [2021-11-07 01:03:55,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433849658] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:55,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:55,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-07 01:03:55,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458314317] [2021-11-07 01:03:55,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:03:55,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:03:55,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:03:55,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:03:55,299 INFO L87 Difference]: Start difference. First operand 335 states and 341 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:56,760 INFO L93 Difference]: Finished difference Result 509 states and 519 transitions. [2021-11-07 01:03:56,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:03:56,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 01:03:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:56,764 INFO L225 Difference]: With dead ends: 509 [2021-11-07 01:03:56,764 INFO L226 Difference]: Without dead ends: 509 [2021-11-07 01:03:56,765 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-11-07 01:03:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 333. [2021-11-07 01:03:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 209 states have (on average 1.6220095693779903) internal successors, (339), 332 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 339 transitions. [2021-11-07 01:03:56,774 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 339 transitions. Word has length 10 [2021-11-07 01:03:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:56,775 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 339 transitions. [2021-11-07 01:03:56,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 339 transitions. [2021-11-07 01:03:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:03:56,776 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:56,776 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:56,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-07 01:03:56,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:03:56,990 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:03:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash -470878954, now seen corresponding path program 1 times [2021-11-07 01:03:56,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:03:56,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106430580] [2021-11-07 01:03:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:56,992 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:03:56,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:03:56,992 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:03:56,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-07 01:03:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:57,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 01:03:57,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:57,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:57,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-11-07 01:03:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:57,582 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:03:57,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106430580] [2021-11-07 01:03:57,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106430580] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:57,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:57,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-11-07 01:03:57,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103654365] [2021-11-07 01:03:57,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 01:03:57,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:03:57,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 01:03:57,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:03:57,583 INFO L87 Difference]: Start difference. First operand 333 states and 339 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:58,853 INFO L93 Difference]: Finished difference Result 507 states and 517 transitions. [2021-11-07 01:03:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:03:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 01:03:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:58,857 INFO L225 Difference]: With dead ends: 507 [2021-11-07 01:03:58,857 INFO L226 Difference]: Without dead ends: 507 [2021-11-07 01:03:58,858 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-11-07 01:03:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-11-07 01:03:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 331. [2021-11-07 01:03:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 209 states have (on average 1.61244019138756) internal successors, (337), 330 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 337 transitions. [2021-11-07 01:03:58,865 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 337 transitions. Word has length 12 [2021-11-07 01:03:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:58,866 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 337 transitions. [2021-11-07 01:03:58,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 337 transitions. [2021-11-07 01:03:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:03:58,867 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:58,867 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:58,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-07 01:03:59,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:03:59,078 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:03:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash -470878955, now seen corresponding path program 1 times [2021-11-07 01:03:59,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:03:59,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225525839] [2021-11-07 01:03:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:59,079 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:03:59,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:03:59,080 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:03:59,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-07 01:03:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:59,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 01:03:59,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:59,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:59,298 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:03:59,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225525839] [2021-11-07 01:03:59,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225525839] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:59,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:59,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 01:03:59,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175773312] [2021-11-07 01:03:59,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:59,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:03:59,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:59,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:59,300 INFO L87 Difference]: Start difference. First operand 331 states and 337 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:59,690 INFO L93 Difference]: Finished difference Result 345 states and 351 transitions. [2021-11-07 01:03:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:03:59,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 01:03:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:59,692 INFO L225 Difference]: With dead ends: 345 [2021-11-07 01:03:59,692 INFO L226 Difference]: Without dead ends: 345 [2021-11-07 01:03:59,692 INFO L786 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 [2021-11-07 01:03:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-07 01:03:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 329. [2021-11-07 01:03:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 209 states have (on average 1.6028708133971292) internal successors, (335), 328 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 335 transitions. [2021-11-07 01:03:59,699 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 335 transitions. Word has length 12 [2021-11-07 01:03:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:59,699 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 335 transitions. [2021-11-07 01:03:59,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:03:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 335 transitions. [2021-11-07 01:03:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:03:59,700 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:59,701 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:03:59,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-07 01:03:59,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:03:59,912 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:03:59,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:59,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1914034178, now seen corresponding path program 1 times [2021-11-07 01:03:59,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:03:59,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398022027] [2021-11-07 01:03:59,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:59,914 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:03:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:03:59,915 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:03:59,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-07 01:04:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:00,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 01:04:00,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:00,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:00,277 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:04:00,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398022027] [2021-11-07 01:04:00,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398022027] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:00,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:00,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 01:04:00,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771172229] [2021-11-07 01:04:00,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:04:00,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:04:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:04:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:04:00,278 INFO L87 Difference]: Start difference. First operand 329 states and 335 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:00,589 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2021-11-07 01:04:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:04:00,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:04:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:00,591 INFO L225 Difference]: With dead ends: 325 [2021-11-07 01:04:00,592 INFO L226 Difference]: Without dead ends: 325 [2021-11-07 01:04:00,592 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:04:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-11-07 01:04:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-11-07 01:04:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 207 states have (on average 1.5990338164251208) internal successors, (331), 324 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 331 transitions. [2021-11-07 01:04:00,599 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 331 transitions. Word has length 21 [2021-11-07 01:04:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:00,599 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 331 transitions. [2021-11-07 01:04:00,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 331 transitions. [2021-11-07 01:04:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:04:00,600 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:00,601 INFO L513 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] [2021-11-07 01:04:00,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:00,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:04:00,813 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:04:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash 794488727, now seen corresponding path program 1 times [2021-11-07 01:04:00,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:04:00,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271017163] [2021-11-07 01:04:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:00,814 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:04:00,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:04:00,815 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:04:00,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-07 01:04:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:01,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 01:04:01,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:01,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:01,212 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-07 01:04:01,213 INFO L388 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 18 treesize of output 17 [2021-11-07 01:04:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:01,234 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:04:01,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271017163] [2021-11-07 01:04:01,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271017163] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:01,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:01,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-07 01:04:01,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736175808] [2021-11-07 01:04:01,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:04:01,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:04:01,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:04:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:04:01,236 INFO L87 Difference]: Start difference. First operand 325 states and 331 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:02,095 INFO L93 Difference]: Finished difference Result 480 states and 490 transitions. [2021-11-07 01:04:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:04:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 01:04:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:02,098 INFO L225 Difference]: With dead ends: 480 [2021-11-07 01:04:02,098 INFO L226 Difference]: Without dead ends: 480 [2021-11-07 01:04:02,099 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:04:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-11-07 01:04:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 315. [2021-11-07 01:04:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 207 states have (on average 1.5507246376811594) internal successors, (321), 314 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 321 transitions. [2021-11-07 01:04:02,107 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 321 transitions. Word has length 22 [2021-11-07 01:04:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:02,107 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 321 transitions. [2021-11-07 01:04:02,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 321 transitions. [2021-11-07 01:04:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:04:02,109 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:02,109 INFO L513 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] [2021-11-07 01:04:02,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:02,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:04:02,315 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:04:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash 794488728, now seen corresponding path program 1 times [2021-11-07 01:04:02,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:04:02,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239678722] [2021-11-07 01:04:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:02,318 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:04:02,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:04:02,319 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:04:02,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-07 01:04:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:02,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-07 01:04:02,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:02,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:03,027 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:04:03,028 INFO L388 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 22 treesize of output 26 [2021-11-07 01:04:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:03,247 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:04:03,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239678722] [2021-11-07 01:04:03,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239678722] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:03,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:03,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-11-07 01:04:03,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537703850] [2021-11-07 01:04:03,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 01:04:03,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:04:03,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 01:04:03,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:04:03,249 INFO L87 Difference]: Start difference. First operand 315 states and 321 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:04,880 INFO L93 Difference]: Finished difference Result 474 states and 484 transitions. [2021-11-07 01:04:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:04:04,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 01:04:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:04,883 INFO L225 Difference]: With dead ends: 474 [2021-11-07 01:04:04,883 INFO L226 Difference]: Without dead ends: 474 [2021-11-07 01:04:04,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:04:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-07 01:04:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 311. [2021-11-07 01:04:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 207 states have (on average 1.5314009661835748) internal successors, (317), 310 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 317 transitions. [2021-11-07 01:04:04,891 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 317 transitions. Word has length 22 [2021-11-07 01:04:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:04,892 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 317 transitions. [2021-11-07 01:04:04,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 317 transitions. [2021-11-07 01:04:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:04:04,893 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:04,893 INFO L513 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] [2021-11-07 01:04:04,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:05,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:04:05,108 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:04:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1000510088, now seen corresponding path program 1 times [2021-11-07 01:04:05,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:04:05,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048275267] [2021-11-07 01:04:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:05,109 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:04:05,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:04:05,110 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:04:05,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-07 01:04:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:05,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-07 01:04:05,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:05,506 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-07 01:04:05,506 INFO L388 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 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-07 01:04:05,656 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-07 01:04:05,656 INFO L388 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 17 treesize of output 17 [2021-11-07 01:04:05,873 INFO L388 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 [2021-11-07 01:04:05,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-07 01:04:06,032 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-07 01:04:06,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 27 [2021-11-07 01:04:06,183 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-07 01:04:06,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2021-11-07 01:04:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:06,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:16,467 INFO L388 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 178 treesize of output 170 [2021-11-07 01:04:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:16,731 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:04:16,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048275267] [2021-11-07 01:04:16,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048275267] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:16,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:16,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2021-11-07 01:04:16,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017820283] [2021-11-07 01:04:16,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:04:16,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:04:16,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:04:16,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=216, Unknown=4, NotChecked=0, Total=272 [2021-11-07 01:04:16,734 INFO L87 Difference]: Start difference. First operand 311 states and 317 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:30,101 INFO L93 Difference]: Finished difference Result 483 states and 493 transitions. [2021-11-07 01:04:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:04:30,102 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:04:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:30,104 INFO L225 Difference]: With dead ends: 483 [2021-11-07 01:04:30,104 INFO L226 Difference]: Without dead ends: 483 [2021-11-07 01:04:30,105 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=216, Invalid=592, Unknown=4, NotChecked=0, Total=812 [2021-11-07 01:04:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-11-07 01:04:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 331. [2021-11-07 01:04:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 228 states have (on average 1.5175438596491229) internal successors, (346), 330 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 346 transitions. [2021-11-07 01:04:30,113 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 346 transitions. Word has length 24 [2021-11-07 01:04:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:30,113 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 346 transitions. [2021-11-07 01:04:30,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 346 transitions. [2021-11-07 01:04:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:04:30,115 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:30,115 INFO L513 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] [2021-11-07 01:04:30,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:30,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:04:30,328 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:04:30,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash -951035532, now seen corresponding path program 1 times [2021-11-07 01:04:30,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:04:30,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996283594] [2021-11-07 01:04:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:30,328 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:04:30,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:04:30,329 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:04:30,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-07 01:04:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:30,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 01:04:30,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:30,674 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-11-07 01:04:30,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2021-11-07 01:04:30,757 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-07 01:04:30,757 INFO L388 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 3 case distinctions, treesize of input 42 treesize of output 63 [2021-11-07 01:04:31,043 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-07 01:04:31,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 52 [2021-11-07 01:04:31,089 INFO L354 Elim1Store]: treesize reduction 2, result has 92.0 percent of original size [2021-11-07 01:04:31,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 65 [2021-11-07 01:04:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:31,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:34,250 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:04:34,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996283594] [2021-11-07 01:04:34,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996283594] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:34,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:34,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2021-11-07 01:04:34,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733036450] [2021-11-07 01:04:34,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:04:34,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-07 01:04:34,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:04:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-11-07 01:04:34,252 INFO L87 Difference]: Start difference. First operand 331 states and 346 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:36,102 INFO L93 Difference]: Finished difference Result 343 states and 358 transitions. [2021-11-07 01:04:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:04:36,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 01:04:36,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:36,105 INFO L225 Difference]: With dead ends: 343 [2021-11-07 01:04:36,105 INFO L226 Difference]: Without dead ends: 343 [2021-11-07 01:04:36,105 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=42, Invalid=67, Unknown=1, NotChecked=0, Total=110 [2021-11-07 01:04:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-11-07 01:04:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 327. [2021-11-07 01:04:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 228 states have (on average 1.5) internal successors, (342), 326 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 342 transitions. [2021-11-07 01:04:36,113 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 342 transitions. Word has length 25 [2021-11-07 01:04:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:36,113 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 342 transitions. [2021-11-07 01:04:36,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 342 transitions. [2021-11-07 01:04:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:04:36,114 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:36,115 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:36,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:36,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:04:36,327 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 142 more)] === [2021-11-07 01:04:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1591099974, now seen corresponding path program 1 times [2021-11-07 01:04:36,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-07 01:04:36,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455423458] [2021-11-07 01:04:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:36,328 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 01:04:36,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat [2021-11-07 01:04:36,329 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 01:04:36,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-07 01:04:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:36,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-07 01:04:36,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:36,826 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-07 01:04:36,826 INFO L388 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 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-07 01:04:37,036 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-07 01:04:37,037 INFO L388 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 21 treesize of output 28 [2021-11-07 01:04:37,532 INFO L388 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 [2021-11-07 01:04:37,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-07 01:04:37,722 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-07 01:04:37,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 38 [2021-11-07 01:04:37,945 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-11-07 01:04:37,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 71 [2021-11-07 01:04:38,312 INFO L354 Elim1Store]: treesize reduction 566, result has 2.9 percent of original size [2021-11-07 01:04:38,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 59 [2021-11-07 01:04:38,658 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-07 01:04:38,659 INFO L388 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 97 treesize of output 70 [2021-11-07 01:04:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:04:38,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:39,145 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:04:39,146 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-07 01:04:44,840 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_28 (store (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_28) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28))))))) is different from false [2021-11-07 01:04:46,976 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.offset_27 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) (bvadd c_ULTIMATE.start_gl_insert_~node~1.offset (_ bv12 32)) c_ULTIMATE.start_gl_insert_~node~1.base)))) (store .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_28 (store (store (store (store (select .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_28) v_ULTIMATE.start_gl_insert_~node~1.offset_27 v_DerPreprocessor_13) (bvadd v_ULTIMATE.start_gl_insert_~node~1.offset_27 (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) v_ULTIMATE.start_gl_insert_~node~1.offset_27) v_DerPreprocessor_15) (bvadd (_ bv3 32) v_ULTIMATE.start_gl_insert_~node~1.offset_27) v_DerPreprocessor_16))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))))) (_ bv1 1))))) is different from false [2021-11-07 01:04:49,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.offset_27 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv12 32)) c_ULTIMATE.start_gl_insert_~node~1.base)))) (store .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_28 (store (store (store (store (select .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_28) v_ULTIMATE.start_gl_insert_~node~1.offset_27 v_DerPreprocessor_13) (bvadd v_ULTIMATE.start_gl_insert_~node~1.offset_27 (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) v_ULTIMATE.start_gl_insert_~node~1.offset_27) v_DerPreprocessor_15) (bvadd (_ bv3 32) v_ULTIMATE.start_gl_insert_~node~1.offset_27) v_DerPreprocessor_16))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_28))))))) is different from false [2021-11-07 01:04:49,168 INFO L388 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 11014098 treesize of output 10997714 [2021-11-07 01:05:16,079 WARN L207 SmtUtils]: Spent 26.91 s on a formula simplification that was a NOOP. DAG size: 2990 [2021-11-07 01:05:16,215 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-07 01:05:16,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455423458] [2021-11-07 01:05:16,215 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-07 01:05:16,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1970329912] [2021-11-07 01:05:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:05:16,216 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-07 01:05:16,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/cvc4 [2021-11-07 01:05:16,226 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-07 01:05:16,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-11-07 01:05:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:05:16,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-07 01:05:16,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:05:16,966 INFO L388 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 7 treesize of output 3 [2021-11-07 01:05:17,068 INFO L388 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 [2021-11-07 01:05:17,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 01:05:17,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:05:17,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-07 01:05:18,057 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-07 01:05:18,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 36 [2021-11-07 01:05:18,331 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-07 01:05:18,331 INFO L388 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 27 treesize of output 38 [2021-11-07 01:05:18,757 INFO L354 Elim1Store]: treesize reduction 566, result has 2.9 percent of original size [2021-11-07 01:05:18,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 57 [2021-11-07 01:05:19,185 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-07 01:05:19,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 45 [2021-11-07 01:05:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:05:19,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:05:19,579 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:05:19,581 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-11-07 01:05:27,910 INFO L388 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 1507797 treesize of output 1505749 [2021-11-07 01:05:31,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-07 01:05:31,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090727338] [2021-11-07 01:05:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:05:31,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:05:31,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:05:31,255 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:05:31,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-07 01:05:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:05:31,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-07 01:05:31,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:05:31,750 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-11-07 01:05:31,750 INFO L388 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 3 case distinctions, treesize of input 15 treesize of output 37 [2021-11-07 01:05:31,943 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-07 01:05:31,944 INFO L388 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 24 treesize of output 31 [2021-11-07 01:05:32,321 INFO L388 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 [2021-11-07 01:05:32,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-07 01:05:32,483 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-07 01:05:32,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 38 [2021-11-07 01:05:32,697 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-11-07 01:05:32,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 63 [2021-11-07 01:05:32,997 INFO L354 Elim1Store]: treesize reduction 566, result has 2.9 percent of original size [2021-11-07 01:05:32,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 59 [2021-11-07 01:05:33,225 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-07 01:05:33,225 INFO L388 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 97 treesize of output 70 [2021-11-07 01:05:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:05:33,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:05:33,528 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:05:33,534 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-07 01:05:41,446 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_30 (store (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_gl_insert_~node~1.base_30) ULTIMATE.start_gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd (_ bv3 32) ULTIMATE.start_gl_insert_~node~1.offset) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30)))))) is different from false [2021-11-07 01:05:43,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.offset_33 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) (bvadd c_ULTIMATE.start_gl_insert_~node~1.offset (_ bv12 32)) c_ULTIMATE.start_gl_insert_~node~1.base)))) (store .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_30 (store (store (store (store (select .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_30) v_ULTIMATE.start_gl_insert_~node~1.offset_33 v_DerPreprocessor_13) (bvadd v_ULTIMATE.start_gl_insert_~node~1.offset_33 (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) v_ULTIMATE.start_gl_insert_~node~1.offset_33) v_DerPreprocessor_15) (bvadd (_ bv3 32) v_ULTIMATE.start_gl_insert_~node~1.offset_33) v_DerPreprocessor_16))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30)))))) is different from false [2021-11-07 01:05:45,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ BitVec 32)) (v_ULTIMATE.start_gl_insert_~node~1.offset_33 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (ULTIMATE.start_gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_gl_insert_~node~1.base) (bvadd ULTIMATE.start_gl_insert_~node~1.offset (_ bv12 32)) c_ULTIMATE.start_gl_insert_~node~1.base)))) (store .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_30 (store (store (store (store (select .cse0 v_ULTIMATE.start_gl_insert_~node~1.base_30) v_ULTIMATE.start_gl_insert_~node~1.offset_33 v_DerPreprocessor_13) (bvadd v_ULTIMATE.start_gl_insert_~node~1.offset_33 (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) v_ULTIMATE.start_gl_insert_~node~1.offset_33) v_DerPreprocessor_15) (bvadd (_ bv3 32) v_ULTIMATE.start_gl_insert_~node~1.offset_33) v_DerPreprocessor_16))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_gl_insert_~node~1.base_30)))))) is different from false [2021-11-07 01:05:45,722 INFO L388 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 22573041 treesize of output 22540273 [2021-11-07 01:06:39,682 WARN L207 SmtUtils]: Spent 53.96 s on a formula simplification that was a NOOP. DAG size: 2440 [2021-11-07 01:06:39,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-07 01:06:39,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:06:39,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-07 01:06:39,910 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-11-07 01:06:39,910 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-11-07 01:06:39,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-07 01:06:39,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-07 01:06:39,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-07 01:06:39,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-07 01:06:39,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-07 01:06:39,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-07 01:06:39,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-07 01:06:39,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-07 01:06:39,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-07 01:06:39,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-07 01:06:39,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-07 01:06:39,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-07 01:06:39,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-07 01:06:39,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-07 01:06:39,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-07 01:06:39,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-07 01:06:39,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-07 01:06:39,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-07 01:06:39,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-07 01:06:39,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-07 01:06:39,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-07 01:06:39,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-07 01:06:39,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-07 01:06:39,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-07 01:06:39,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-07 01:06:39,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-07 01:06:39,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-07 01:06:39,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-07 01:06:39,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-07 01:06:39,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-07 01:06:39,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-07 01:06:39,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-07 01:06:39,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-07 01:06:39,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-07 01:06:39,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-07 01:06:39,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-07 01:06:39,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-11-07 01:06:39,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-11-07 01:06:39,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-07 01:06:39,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-07 01:06:39,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-07 01:06:39,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-07 01:06:39,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-11-07 01:06:39,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-11-07 01:06:39,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-11-07 01:06:39,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-11-07 01:06:39,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-11-07 01:06:39,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-11-07 01:06:39,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-11-07 01:06:39,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-11-07 01:06:39,932 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-11-07 01:06:39,932 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-11-07 01:06:39,932 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-11-07 01:06:39,932 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-11-07 01:06:39,932 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-11-07 01:06:39,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-11-07 01:06:39,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-11-07 01:06:39,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-11-07 01:06:39,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-11-07 01:06:39,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-11-07 01:06:39,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-11-07 01:06:39,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-11-07 01:06:39,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-11-07 01:06:39,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-11-07 01:06:39,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-11-07 01:06:39,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-11-07 01:06:39,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-11-07 01:06:39,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-11-07 01:06:39,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-11-07 01:06:39,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-11-07 01:06:39,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-11-07 01:06:39,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-11-07 01:06:39,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-11-07 01:06:39,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-11-07 01:06:39,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-11-07 01:06:39,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-11-07 01:06:39,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-11-07 01:06:39,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-11-07 01:06:39,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-11-07 01:06:39,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION [2021-11-07 01:06:39,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-11-07 01:06:39,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103REQUIRES_VIOLATION [2021-11-07 01:06:39,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-11-07 01:06:39,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-11-07 01:06:39,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-11-07 01:06:39,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110REQUIRES_VIOLATION [2021-11-07 01:06:39,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-11-07 01:06:39,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-11-07 01:06:39,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-11-07 01:06:39,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-11-07 01:06:39,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-11-07 01:06:39,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-11-07 01:06:39,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-11-07 01:06:39,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-11-07 01:06:39,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATION [2021-11-07 01:06:39,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-11-07 01:06:39,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-11-07 01:06:39,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129REQUIRES_VIOLATION [2021-11-07 01:06:39,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-11-07 01:06:39,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-11-07 01:06:39,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-11-07 01:06:39,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134REQUIRES_VIOLATION [2021-11-07 01:06:39,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136REQUIRES_VIOLATION [2021-11-07 01:06:39,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137REQUIRES_VIOLATION [2021-11-07 01:06:39,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138REQUIRES_VIOLATION [2021-11-07 01:06:39,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139REQUIRES_VIOLATION [2021-11-07 01:06:39,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140REQUIRES_VIOLATION [2021-11-07 01:06:39,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141REQUIRES_VIOLATION [2021-11-07 01:06:39,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:06:39,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:06:39,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:06:39,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:06:39,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-07 01:06:40,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2021-11-07 01:06:40,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-07 01:06:40,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/mathsat -unsat_core_generation=3 [2021-11-07 01:06:40,566 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:06:40,575 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:06:40,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:06:40 BoogieIcfgContainer [2021-11-07 01:06:40,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:06:40,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:06:40,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:06:40,604 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:06:40,605 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:02:11" (3/4) ... [2021-11-07 01:06:40,611 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 01:06:40,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:06:40,613 INFO L168 Benchmark]: Toolchain (without parser) took 271607.11 ms. Allocated memory was 56.6 MB in the beginning and 436.2 MB in the end (delta: 379.6 MB). Free memory was 32.8 MB in the beginning and 212.0 MB in the end (delta: -179.2 MB). Peak memory consumption was 200.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:06:40,614 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 56.6 MB. Free memory is still 38.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:06:40,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.88 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 32.6 MB in the beginning and 41.7 MB in the end (delta: -9.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2021-11-07 01:06:40,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.73 ms. Allocated memory is still 69.2 MB. Free memory was 41.7 MB in the beginning and 37.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:06:40,615 INFO L168 Benchmark]: Boogie Preprocessor took 113.64 ms. Allocated memory is still 69.2 MB. Free memory was 37.5 MB in the beginning and 33.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:06:40,616 INFO L168 Benchmark]: RCFGBuilder took 1478.71 ms. Allocated memory is still 69.2 MB. Free memory was 33.6 MB in the beginning and 40.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:06:40,616 INFO L168 Benchmark]: TraceAbstraction took 269072.26 ms. Allocated memory was 69.2 MB in the beginning and 436.2 MB in the end (delta: 367.0 MB). Free memory was 39.4 MB in the beginning and 212.0 MB in the end (delta: -172.6 MB). Peak memory consumption was 268.0 MB. Max. memory is 16.1 GB. [2021-11-07 01:06:40,617 INFO L168 Benchmark]: Witness Printer took 7.58 ms. Allocated memory is still 436.2 MB. Free memory is still 212.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:06:40,620 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.21 ms. Allocated memory is still 56.6 MB. Free memory is still 38.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 787.88 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 32.6 MB in the beginning and 41.7 MB in the end (delta: -9.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 127.73 ms. Allocated memory is still 69.2 MB. Free memory was 41.7 MB in the beginning and 37.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 113.64 ms. Allocated memory is still 69.2 MB. Free memory was 37.5 MB in the beginning and 33.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1478.71 ms. Allocated memory is still 69.2 MB. Free memory was 33.6 MB in the beginning and 40.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 269072.26 ms. Allocated memory was 69.2 MB in the beginning and 436.2 MB in the end (delta: 367.0 MB). Free memory was 39.4 MB in the beginning and 212.0 MB in the end (delta: -172.6 MB). Peak memory consumption was 268.0 MB. Max. memory is 16.1 GB. * Witness Printer took 7.58 ms. Allocated memory is still 436.2 MB. Free memory is still 212.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L890] head->next [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) [L911] COND TRUE __VERIFIER_nondet_int() [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L890] head->next [L878] next->prev = new - UnprovableResult [Line: 902]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 928]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 928]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 886]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 886]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 916]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 916]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 947]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 353 locations, 146 error locations. Started 1 CEGAR loops. OverallTime: 268.9s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 68.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3861 SDtfs, 17668 SDslu, 7123 SDs, 0 SdLazy, 6074 SolverSat, 226 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 53.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 288 SyntacticMatches, 6 SemanticMatches, 143 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 71.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=0, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1638 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 109.7s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 402 ConstructedInterpolants, 79 QuantifiedInterpolants, 5686 SizeOfPredicates, 140 NumberOfNonLiveVariables, 1475 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 33 InterpolantComputations, 32 PerfectInterpolantSequences, 3/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-07 01:06:40,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe7416c-0df5-469c-adc3-3c176f4c79d2/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN