./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur --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 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:56:04,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:56:04,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:56:04,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:56:04,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:56:04,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:56:04,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:56:04,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:56:04,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:56:04,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:56:04,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:56:04,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:56:04,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:56:04,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:56:04,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:56:04,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:56:04,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:56:04,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:56:04,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:56:04,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:56:04,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:56:04,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:56:04,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:56:04,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:56:04,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:56:04,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:56:04,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:56:04,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:56:04,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:56:04,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:56:04,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:56:04,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:56:04,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:56:04,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:56:04,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:56:04,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:56:04,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:56:04,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:56:04,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:56:04,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:56:04,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:56:04,325 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-26 00:56:04,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:56:04,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:56:04,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:56:04,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:56:04,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:56:04,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:56:04,358 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:56:04,358 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:56:04,358 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:56:04,358 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:56:04,359 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:56:04,359 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:56:04,359 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:56:04,359 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:56:04,359 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:56:04,360 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:56:04,360 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:56:04,360 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:56:04,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:56:04,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:56:04,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:56:04,361 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:56:04,362 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:56:04,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:56:04,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:56:04,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:56:04,362 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:56:04,363 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:56:04,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:56:04,363 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:56:04,363 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:56:04,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:56:04,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:56:04,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:56:04,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:56:04,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:56:04,366 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:56:04,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:56:04,367 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:56:04,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:56:04,367 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:56:04,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/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_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur 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 -> 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 [2022-11-26 00:56:04,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:56:04,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:56:04,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:56:04,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:56:04,645 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:56:04,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/forester-heap/sll-token-1.i [2022-11-26 00:56:07,717 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:56:08,007 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:56:08,008 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i [2022-11-26 00:56:08,020 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/data/1b8a34d64/9c238c8aba7c459e963922bde1d68b26/FLAGedfe7a490 [2022-11-26 00:56:08,042 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/data/1b8a34d64/9c238c8aba7c459e963922bde1d68b26 [2022-11-26 00:56:08,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:56:08,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:56:08,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:56:08,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:56:08,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:56:08,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7b2f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08, skipping insertion in model container [2022-11-26 00:56:08,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:56:08,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:56:08,381 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2022-11-26 00:56:08,400 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2022-11-26 00:56:08,401 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2022-11-26 00:56:08,402 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2022-11-26 00:56:08,403 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2022-11-26 00:56:08,406 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2022-11-26 00:56:08,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:56:08,421 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:56:08,478 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2022-11-26 00:56:08,480 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2022-11-26 00:56:08,481 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2022-11-26 00:56:08,482 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2022-11-26 00:56:08,494 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2022-11-26 00:56:08,498 WARN L237 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_50b00753-9c56-4fc3-b7b7-0300e29931a6/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2022-11-26 00:56:08,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:56:08,533 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:56:08,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08 WrapperNode [2022-11-26 00:56:08,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:56:08,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:56:08,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:56:08,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:56:08,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,580 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2022-11-26 00:56:08,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:56:08,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:56:08,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:56:08,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:56:08,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,618 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:56:08,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:56:08,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:56:08,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:56:08,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (1/1) ... [2022-11-26 00:56:08,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:56:08,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:08,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:56:08,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:56:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:56:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:56:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:56:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:56:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:56:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:56:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:56:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:56:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:56:08,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:56:08,805 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:56:08,807 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:56:09,290 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:56:09,348 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:56:09,348 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-11-26 00:56:09,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:56:09 BoogieIcfgContainer [2022-11-26 00:56:09,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:56:09,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:56:09,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:56:09,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:56:09,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:56:08" (1/3) ... [2022-11-26 00:56:09,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414377a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:56:09, skipping insertion in model container [2022-11-26 00:56:09,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:08" (2/3) ... [2022-11-26 00:56:09,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414377a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:56:09, skipping insertion in model container [2022-11-26 00:56:09,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:56:09" (3/3) ... [2022-11-26 00:56:09,372 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2022-11-26 00:56:09,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:56:09,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-11-26 00:56:09,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:56:09,467 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4cd6053c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:56:09,467 INFO L358 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2022-11-26 00:56:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 107 states have internal predecessors, (131), 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) [2022-11-26 00:56:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 00:56:09,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:09,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 00:56:09,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash 8405, now seen corresponding path program 1 times [2022-11-26 00:56:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:09,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632231417] [2022-11-26 00:56:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:09,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:09,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632231417] [2022-11-26 00:56:09,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632231417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:09,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:09,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:56:09,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398840295] [2022-11-26 00:56:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:09,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:56:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:09,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:56:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:09,849 INFO L87 Difference]: Start difference. First operand has 108 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 107 states have internal predecessors, (131), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-26 00:56:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:10,008 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-11-26 00:56:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:56:10,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-26 00:56:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:10,022 INFO L225 Difference]: With dead ends: 126 [2022-11-26 00:56:10,022 INFO L226 Difference]: Without dead ends: 125 [2022-11-26 00:56:10,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:10,028 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 86 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:10,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 84 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-26 00:56:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2022-11-26 00:56:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 53 states have (on average 2.018867924528302) internal successors, (107), 104 states have internal predecessors, (107), 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) [2022-11-26 00:56:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2022-11-26 00:56:10,064 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 2 [2022-11-26 00:56:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:10,064 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2022-11-26 00:56:10,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-26 00:56:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2022-11-26 00:56:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 00:56:10,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:10,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 00:56:10,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:56:10,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash 8406, now seen corresponding path program 1 times [2022-11-26 00:56:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:10,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684420678] [2022-11-26 00:56:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:10,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:10,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:10,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684420678] [2022-11-26 00:56:10,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684420678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:10,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:10,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:56:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132825768] [2022-11-26 00:56:10,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:10,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:56:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:56:10,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:10,242 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-26 00:56:10,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:10,394 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2022-11-26 00:56:10,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:56:10,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-26 00:56:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:10,398 INFO L225 Difference]: With dead ends: 131 [2022-11-26 00:56:10,399 INFO L226 Difference]: Without dead ends: 131 [2022-11-26 00:56:10,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:10,400 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:10,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 89 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-26 00:56:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2022-11-26 00:56:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 102 states have internal predecessors, (105), 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) [2022-11-26 00:56:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2022-11-26 00:56:10,423 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 2 [2022-11-26 00:56:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:10,424 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2022-11-26 00:56:10,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-26 00:56:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2022-11-26 00:56:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:56:10,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:10,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:56:10,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:56:10,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -821381070, now seen corresponding path program 1 times [2022-11-26 00:56:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:10,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917910593] [2022-11-26 00:56:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:10,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:10,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917910593] [2022-11-26 00:56:10,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917910593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:10,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:10,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:56:10,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874178068] [2022-11-26 00:56:10,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:10,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:10,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:10,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:10,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:56:10,545 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-11-26 00:56:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:10,720 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-11-26 00:56:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:56:10,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-11-26 00:56:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:10,722 INFO L225 Difference]: With dead ends: 109 [2022-11-26 00:56:10,722 INFO L226 Difference]: Without dead ends: 109 [2022-11-26 00:56:10,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:10,728 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 152 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:10,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 60 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-26 00:56:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2022-11-26 00:56:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 91 states have internal predecessors, (96), 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) [2022-11-26 00:56:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-11-26 00:56:10,754 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2022-11-26 00:56:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:10,755 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-11-26 00:56:10,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-11-26 00:56:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-11-26 00:56:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:56:10,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:10,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:56:10,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:56:10,757 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:10,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash -821381069, now seen corresponding path program 1 times [2022-11-26 00:56:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:10,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942915568] [2022-11-26 00:56:10,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:10,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:10,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942915568] [2022-11-26 00:56:10,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942915568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:10,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:10,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:56:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795270976] [2022-11-26 00:56:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:10,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:10,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:10,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:56:10,919 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-11-26 00:56:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:11,148 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2022-11-26 00:56:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:56:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-26 00:56:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:11,153 INFO L225 Difference]: With dead ends: 166 [2022-11-26 00:56:11,153 INFO L226 Difference]: Without dead ends: 166 [2022-11-26 00:56:11,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:11,160 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 172 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:11,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 93 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:56:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-26 00:56:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2022-11-26 00:56:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.5853658536585367) internal successors, (130), 118 states have internal predecessors, (130), 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) [2022-11-26 00:56:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2022-11-26 00:56:11,178 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 6 [2022-11-26 00:56:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:11,179 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2022-11-26 00:56:11,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-11-26 00:56:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2022-11-26 00:56:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:56:11,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:11,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:11,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:56:11,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:11,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash 927018906, now seen corresponding path program 1 times [2022-11-26 00:56:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:11,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700066343] [2022-11-26 00:56:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:11,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:11,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:11,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700066343] [2022-11-26 00:56:11,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700066343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:11,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:11,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:56:11,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599515754] [2022-11-26 00:56:11,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:11,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:56:11,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:11,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:56:11,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:11,353 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2022-11-26 00:56:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:11,519 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2022-11-26 00:56:11,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:56:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 8 [2022-11-26 00:56:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:11,530 INFO L225 Difference]: With dead ends: 118 [2022-11-26 00:56:11,531 INFO L226 Difference]: Without dead ends: 118 [2022-11-26 00:56:11,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:56:11,533 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:11,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 141 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-26 00:56:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-26 00:56:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 117 states have internal predecessors, (129), 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) [2022-11-26 00:56:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2022-11-26 00:56:11,548 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 8 [2022-11-26 00:56:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:11,549 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2022-11-26 00:56:11,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2022-11-26 00:56:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2022-11-26 00:56:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:56:11,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:11,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:11,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:56:11,550 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash 927018907, now seen corresponding path program 1 times [2022-11-26 00:56:11,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:11,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482523703] [2022-11-26 00:56:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:11,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:11,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:11,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482523703] [2022-11-26 00:56:11,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482523703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:11,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:11,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:56:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99873202] [2022-11-26 00:56:11,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:11,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:56:11,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:56:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:11,733 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2022-11-26 00:56:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:11,900 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2022-11-26 00:56:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:56:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 8 [2022-11-26 00:56:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:11,901 INFO L225 Difference]: With dead ends: 115 [2022-11-26 00:56:11,901 INFO L226 Difference]: Without dead ends: 115 [2022-11-26 00:56:11,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:56:11,902 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 12 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:11,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 206 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-26 00:56:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2022-11-26 00:56:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 104 states have internal predecessors, (115), 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) [2022-11-26 00:56:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2022-11-26 00:56:11,907 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 8 [2022-11-26 00:56:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:11,908 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2022-11-26 00:56:11,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2022-11-26 00:56:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2022-11-26 00:56:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:56:11,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:11,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:11,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:56:11,909 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:11,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1329117493, now seen corresponding path program 1 times [2022-11-26 00:56:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:11,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773989129] [2022-11-26 00:56:11,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:12,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:12,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773989129] [2022-11-26 00:56:12,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773989129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:12,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:12,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:56:12,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456557555] [2022-11-26 00:56:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:12,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:56:12,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:56:12,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:12,014 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-11-26 00:56:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:12,129 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-11-26 00:56:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:56:12,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 [2022-11-26 00:56:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:12,130 INFO L225 Difference]: With dead ends: 104 [2022-11-26 00:56:12,130 INFO L226 Difference]: Without dead ends: 104 [2022-11-26 00:56:12,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:56:12,131 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:12,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 211 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-26 00:56:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-26 00:56:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.52) internal successors, (114), 103 states have internal predecessors, (114), 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) [2022-11-26 00:56:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-11-26 00:56:12,136 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 9 [2022-11-26 00:56:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:12,136 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-11-26 00:56:12,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-11-26 00:56:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-11-26 00:56:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:56:12,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:12,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:12,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:56:12,138 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1329117492, now seen corresponding path program 1 times [2022-11-26 00:56:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:12,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975436591] [2022-11-26 00:56:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:12,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:12,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975436591] [2022-11-26 00:56:12,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975436591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:12,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:12,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:56:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99819401] [2022-11-26 00:56:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:12,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:56:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:56:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:12,310 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-11-26 00:56:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:12,429 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-11-26 00:56:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:56:12,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 [2022-11-26 00:56:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:12,430 INFO L225 Difference]: With dead ends: 103 [2022-11-26 00:56:12,430 INFO L226 Difference]: Without dead ends: 103 [2022-11-26 00:56:12,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:56:12,431 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:12,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 213 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-26 00:56:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-26 00:56:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 102 states have internal predecessors, (113), 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) [2022-11-26 00:56:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-11-26 00:56:12,435 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 9 [2022-11-26 00:56:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:12,436 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-11-26 00:56:12,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-11-26 00:56:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-11-26 00:56:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:56:12,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:12,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:12,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:56:12,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:12,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:12,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1806938586, now seen corresponding path program 1 times [2022-11-26 00:56:12,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:12,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087128867] [2022-11-26 00:56:12,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:12,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:12,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087128867] [2022-11-26 00:56:12,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087128867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:12,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:12,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:56:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684379698] [2022-11-26 00:56:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:12,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:56:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:12,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:56:12,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:12,525 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 5 states, 5 states have (on average 2.0) 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) [2022-11-26 00:56:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:12,649 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-26 00:56:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:56:12,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) 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 [2022-11-26 00:56:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:12,651 INFO L225 Difference]: With dead ends: 109 [2022-11-26 00:56:12,651 INFO L226 Difference]: Without dead ends: 109 [2022-11-26 00:56:12,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:56:12,652 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:12,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 221 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-26 00:56:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2022-11-26 00:56:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.5) internal successors, (111), 100 states have internal predecessors, (111), 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) [2022-11-26 00:56:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-11-26 00:56:12,656 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 10 [2022-11-26 00:56:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:12,656 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-11-26 00:56:12,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) 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) [2022-11-26 00:56:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-11-26 00:56:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:56:12,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:12,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:12,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:56:12,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:12,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1676451459, now seen corresponding path program 1 times [2022-11-26 00:56:12,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:12,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461692597] [2022-11-26 00:56:12,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:12,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:12,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461692597] [2022-11-26 00:56:12,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461692597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:12,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:12,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:56:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135706371] [2022-11-26 00:56:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:12,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:56:12,711 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-11-26 00:56:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:12,809 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2022-11-26 00:56:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:56:12,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-11-26 00:56:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:12,811 INFO L225 Difference]: With dead ends: 150 [2022-11-26 00:56:12,811 INFO L226 Difference]: Without dead ends: 150 [2022-11-26 00:56:12,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:12,812 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 150 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:12,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 113 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-26 00:56:12,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2022-11-26 00:56:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 98 states have internal predecessors, (109), 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) [2022-11-26 00:56:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2022-11-26 00:56:12,816 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 11 [2022-11-26 00:56:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:12,816 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2022-11-26 00:56:12,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-11-26 00:56:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-11-26 00:56:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 00:56:12,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:12,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:12,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:56:12,818 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2022-11-26 00:56:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 935207482, now seen corresponding path program 1 times [2022-11-26 00:56:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:12,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417049350] [2022-11-26 00:56:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:56:12,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:56:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:56:12,875 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:56:12,875 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:56:12,876 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2022-11-26 00:56:12,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2022-11-26 00:56:12,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2022-11-26 00:56:12,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2022-11-26 00:56:12,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2022-11-26 00:56:12,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2022-11-26 00:56:12,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2022-11-26 00:56:12,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2022-11-26 00:56:12,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2022-11-26 00:56:12,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2022-11-26 00:56:12,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2022-11-26 00:56:12,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (42 of 54 remaining) [2022-11-26 00:56:12,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2022-11-26 00:56:12,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2022-11-26 00:56:12,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2022-11-26 00:56:12,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2022-11-26 00:56:12,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2022-11-26 00:56:12,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2022-11-26 00:56:12,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2022-11-26 00:56:12,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2022-11-26 00:56:12,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (33 of 54 remaining) [2022-11-26 00:56:12,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2022-11-26 00:56:12,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2022-11-26 00:56:12,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2022-11-26 00:56:12,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2022-11-26 00:56:12,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (28 of 54 remaining) [2022-11-26 00:56:12,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2022-11-26 00:56:12,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2022-11-26 00:56:12,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2022-11-26 00:56:12,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 54 remaining) [2022-11-26 00:56:12,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2022-11-26 00:56:12,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2022-11-26 00:56:12,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2022-11-26 00:56:12,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2022-11-26 00:56:12,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (19 of 54 remaining) [2022-11-26 00:56:12,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2022-11-26 00:56:12,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2022-11-26 00:56:12,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2022-11-26 00:56:12,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2022-11-26 00:56:12,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (14 of 54 remaining) [2022-11-26 00:56:12,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (13 of 54 remaining) [2022-11-26 00:56:12,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (12 of 54 remaining) [2022-11-26 00:56:12,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2022-11-26 00:56:12,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2022-11-26 00:56:12,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (9 of 54 remaining) [2022-11-26 00:56:12,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2022-11-26 00:56:12,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2022-11-26 00:56:12,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (6 of 54 remaining) [2022-11-26 00:56:12,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (5 of 54 remaining) [2022-11-26 00:56:12,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (4 of 54 remaining) [2022-11-26 00:56:12,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (3 of 54 remaining) [2022-11-26 00:56:12,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (2 of 54 remaining) [2022-11-26 00:56:12,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (1 of 54 remaining) [2022-11-26 00:56:12,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (0 of 54 remaining) [2022-11-26 00:56:12,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:56:12,893 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:12,898 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:56:12,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:56:12 BoogieIcfgContainer [2022-11-26 00:56:12,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:56:12,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:56:12,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:56:12,920 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:56:12,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:56:09" (3/4) ... [2022-11-26 00:56:12,923 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-26 00:56:12,956 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:56:12,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:56:12,957 INFO L158 Benchmark]: Toolchain (without parser) took 4911.08ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 119.1MB in the beginning and 92.0MB in the end (delta: 27.1MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2022-11-26 00:56:12,957 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 115.3MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:56:12,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.67ms. Allocated memory is still 151.0MB. Free memory was 118.6MB in the beginning and 100.4MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-26 00:56:12,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.64ms. Allocated memory is still 151.0MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:56:12,958 INFO L158 Benchmark]: Boogie Preprocessor took 40.48ms. Allocated memory is still 151.0MB. Free memory was 98.3MB in the beginning and 96.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:56:12,958 INFO L158 Benchmark]: RCFGBuilder took 736.76ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 73.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-26 00:56:12,959 INFO L158 Benchmark]: TraceAbstraction took 3556.25ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 72.6MB in the beginning and 94.1MB in the end (delta: -21.5MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2022-11-26 00:56:12,959 INFO L158 Benchmark]: Witness Printer took 36.22ms. Allocated memory is still 195.0MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:56:12,961 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.23ms. Allocated memory is still 115.3MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.67ms. Allocated memory is still 151.0MB. Free memory was 118.6MB in the beginning and 100.4MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.64ms. Allocated memory is still 151.0MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.48ms. Allocated memory is still 151.0MB. Free memory was 98.3MB in the beginning and 96.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.76ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 73.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3556.25ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 72.6MB in the beginning and 94.1MB in the end (delta: -21.5MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 36.22ms. Allocated memory is still 195.0MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 1031]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) VAL [head={-1:0}] [L1005] head->data = 0 [L1007] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 [L1019] x->next = malloc(sizeof(SLL)) [L1020] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1020] x->next->data = 2 [L1022] x = head VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1026] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1026] COND FALSE !(1 != x->data) [L1031] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1031] COND TRUE !(2 == x->data) [L1031] reach_error() VAL [head={-1:0}, x={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: 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, 108 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 733 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 1431 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 818 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 613 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 181 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-26 00:56:12,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50b00753-9c56-4fc3-b7b7-0300e29931a6/bin/utaipan-ByfvJB40ur/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)