./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/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_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- 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-25 23:21:47,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:21:47,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:21:47,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:21:47,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:21:47,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:21:47,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:21:47,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:21:47,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:21:47,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:21:47,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:21:47,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:21:47,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:21:47,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:21:47,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:21:47,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:21:47,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:21:47,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:21:47,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:21:47,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:21:47,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:21:47,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:21:47,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:21:48,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:21:48,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:21:48,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:21:48,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:21:48,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:21:48,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:21:48,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:21:48,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:21:48,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:21:48,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:21:48,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:21:48,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:21:48,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:21:48,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:21:48,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:21:48,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:21:48,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:21:48,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:21:48,025 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 23:21:48,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:21:48,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:21:48,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:21:48,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:21:48,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:21:48,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:21:48,057 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:21:48,058 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:21:48,058 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:21:48,058 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:21:48,063 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:21:48,063 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:21:48,063 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:21:48,064 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:21:48,064 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:21:48,064 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:21:48,064 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:21:48,064 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:21:48,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:21:48,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:21:48,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:21:48,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:21:48,066 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:21:48,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:21:48,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:21:48,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:21:48,066 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:21:48,066 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:21:48,067 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:21:48,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:21:48,067 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:21:48,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:21:48,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:21:48,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:21:48,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:21:48,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:21:48,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:21:48,068 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:21:48,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:21:48,069 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:21:48,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:21:48,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:21:48,069 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_8da4393b-b9fc-45f6-a08e-185b94b42011/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_8da4393b-b9fc-45f6-a08e-185b94b42011/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2022-11-25 23:21:48,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:21:48,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:21:48,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:21:48,330 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:21:48,331 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:21:48,332 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-25 23:21:51,465 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:21:51,810 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:21:51,810 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-25 23:21:51,824 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/data/2b0e32579/8a0e489f3fec430299e76d4a9f158fb3/FLAG364ed08ed [2022-11-25 23:21:51,842 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/data/2b0e32579/8a0e489f3fec430299e76d4a9f158fb3 [2022-11-25 23:21:51,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:21:51,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:21:51,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:21:51,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:21:51,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:21:51,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:21:51" (1/1) ... [2022-11-25 23:21:51,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b65afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:51, skipping insertion in model container [2022-11-25 23:21:51,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:21:51" (1/1) ... [2022-11-25 23:21:51,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:21:51,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:21:52,073 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_8da4393b-b9fc-45f6-a08e-185b94b42011/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-25 23:21:52,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:21:52,404 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:21:52,416 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_8da4393b-b9fc-45f6-a08e-185b94b42011/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-25 23:21:52,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:21:52,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:21:52,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:21:52,569 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:21:52,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52 WrapperNode [2022-11-25 23:21:52,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:21:52,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:21:52,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:21:52,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:21:52,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,646 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-11-25 23:21:52,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:21:52,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:21:52,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:21:52,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:21:52,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,707 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:21:52,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:21:52,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:21:52,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:21:52,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (1/1) ... [2022-11-25 23:21:52,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:21:52,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:21:52,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:21:52,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:21:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:21:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:21:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 23:21:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:21:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:21:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:21:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 23:21:52,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 23:21:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 23:21:52,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 23:21:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 23:21:52,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 23:21:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:21:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 23:21:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:21:52,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:21:52,805 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:21:52,950 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:21:52,952 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:21:53,669 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:21:54,334 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:21:54,335 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:21:54,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:21:54 BoogieIcfgContainer [2022-11-25 23:21:54,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:21:54,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:21:54,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:21:54,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:21:54,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:21:51" (1/3) ... [2022-11-25 23:21:54,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dafeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:21:54, skipping insertion in model container [2022-11-25 23:21:54,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:21:52" (2/3) ... [2022-11-25 23:21:54,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dafeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:21:54, skipping insertion in model container [2022-11-25 23:21:54,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:21:54" (3/3) ... [2022-11-25 23:21:54,351 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2022-11-25 23:21:54,371 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:21:54,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-25 23:21:54,372 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:21:54,539 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 23:21:54,590 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:21:54,613 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 178 transitions, 371 flow [2022-11-25 23:21:54,618 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 178 transitions, 371 flow [2022-11-25 23:21:54,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 178 transitions, 371 flow [2022-11-25 23:21:54,753 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2022-11-25 23:21:54,756 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 23:21:54,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 2/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 244 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-11-25 23:21:54,770 INFO L119 LiptonReduction]: Number of co-enabled transitions 6624 [2022-11-25 23:22:13,419 INFO L134 LiptonReduction]: Checked pairs total: 34369 [2022-11-25 23:22:13,420 INFO L136 LiptonReduction]: Total number of compositions: 158 [2022-11-25 23:22:13,432 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 73 transitions, 161 flow [2022-11-25 23:22:14,699 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-25 23:22:14,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:22:14,740 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;@6933138f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:22:14,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-25 23:22:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-25 23:22:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-25 23:22:14,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:14,805 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-25 23:22:14,812 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:14,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1138, now seen corresponding path program 1 times [2022-11-25 23:22:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:14,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723616126] [2022-11-25 23:22:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:15,117 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-25 23:22:15,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:15,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723616126] [2022-11-25 23:22:15,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723616126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:15,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:15,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 23:22:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325617907] [2022-11-25 23:22:15,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:15,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:22:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:15,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:22:15,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:22:15,339 INFO L87 Difference]: Start difference. First operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-25 23:22:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:15,864 INFO L93 Difference]: Finished difference Result 15204 states and 54879 transitions. [2022-11-25 23:22:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:22:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-25 23:22:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:16,056 INFO L225 Difference]: With dead ends: 15204 [2022-11-25 23:22:16,056 INFO L226 Difference]: Without dead ends: 15204 [2022-11-25 23:22:16,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:22:16,060 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:16,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2022-11-25 23:22:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15204. [2022-11-25 23:22:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 13315 states have (on average 4.121592189260233) internal successors, (54879), 15203 states have internal predecessors, (54879), 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-25 23:22:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 54879 transitions. [2022-11-25 23:22:17,347 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 54879 transitions. Word has length 1 [2022-11-25 23:22:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:17,349 INFO L495 AbstractCegarLoop]: Abstraction has 15204 states and 54879 transitions. [2022-11-25 23:22:17,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-25 23:22:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 54879 transitions. [2022-11-25 23:22:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:22:17,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:17,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:22:17,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:22:17,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash 34875589, now seen corresponding path program 1 times [2022-11-25 23:22:17,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:17,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763755436] [2022-11-25 23:22:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:17,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:17,675 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-25 23:22:17,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:17,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763755436] [2022-11-25 23:22:17,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763755436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:17,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:17,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:22:17,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861307398] [2022-11-25 23:22:17,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:17,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:22:17,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:17,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:22:17,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:22:17,679 INFO L87 Difference]: Start difference. First operand 15204 states and 54879 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-25 23:22:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:18,099 INFO L93 Difference]: Finished difference Result 13683 states and 49236 transitions. [2022-11-25 23:22:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:22:18,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-25 23:22:18,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:18,201 INFO L225 Difference]: With dead ends: 13683 [2022-11-25 23:22:18,201 INFO L226 Difference]: Without dead ends: 13683 [2022-11-25 23:22:18,203 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-25 23:22:18,204 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:18,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:22:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2022-11-25 23:22:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 13683. [2022-11-25 23:22:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13683 states, 12109 states have (on average 4.066066562061277) internal successors, (49236), 13682 states have internal predecessors, (49236), 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-25 23:22:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 49236 transitions. [2022-11-25 23:22:19,303 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 49236 transitions. Word has length 4 [2022-11-25 23:22:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:19,304 INFO L495 AbstractCegarLoop]: Abstraction has 13683 states and 49236 transitions. [2022-11-25 23:22:19,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-25 23:22:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 49236 transitions. [2022-11-25 23:22:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:22:19,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:19,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:22:19,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:22:19,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:19,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1081144191, now seen corresponding path program 1 times [2022-11-25 23:22:19,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:19,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789448912] [2022-11-25 23:22:19,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:19,564 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-25 23:22:19,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:19,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789448912] [2022-11-25 23:22:19,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789448912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:19,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:19,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:22:19,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514458081] [2022-11-25 23:22:19,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:19,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:22:19,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:19,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:22:19,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:22:19,568 INFO L87 Difference]: Start difference. First operand 13683 states and 49236 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:20,076 INFO L93 Difference]: Finished difference Result 9851 states and 32514 transitions. [2022-11-25 23:22:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:22:20,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:22:20,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:20,161 INFO L225 Difference]: With dead ends: 9851 [2022-11-25 23:22:20,161 INFO L226 Difference]: Without dead ends: 9851 [2022-11-25 23:22:20,162 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-25 23:22:20,165 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:20,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:22:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9851 states. [2022-11-25 23:22:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9851 to 8963. [2022-11-25 23:22:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8963 states, 8434 states have (on average 3.715200379416647) internal successors, (31334), 8962 states have internal predecessors, (31334), 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-25 23:22:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8963 states to 8963 states and 31334 transitions. [2022-11-25 23:22:20,601 INFO L78 Accepts]: Start accepts. Automaton has 8963 states and 31334 transitions. Word has length 5 [2022-11-25 23:22:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:20,602 INFO L495 AbstractCegarLoop]: Abstraction has 8963 states and 31334 transitions. [2022-11-25 23:22:20,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 8963 states and 31334 transitions. [2022-11-25 23:22:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:22:20,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:20,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:22:20,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:22:20,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:20,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:20,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1081144192, now seen corresponding path program 1 times [2022-11-25 23:22:20,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:20,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979150604] [2022-11-25 23:22:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:20,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:20,867 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-25 23:22:20,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:20,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979150604] [2022-11-25 23:22:20,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979150604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:20,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:20,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:22:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068793631] [2022-11-25 23:22:20,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:20,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:22:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:22:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:22:20,875 INFO L87 Difference]: Start difference. First operand 8963 states and 31334 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:21,197 INFO L93 Difference]: Finished difference Result 11450 states and 40305 transitions. [2022-11-25 23:22:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:22:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:22:21,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:21,255 INFO L225 Difference]: With dead ends: 11450 [2022-11-25 23:22:21,255 INFO L226 Difference]: Without dead ends: 11450 [2022-11-25 23:22:21,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-25 23:22:21,258 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:21,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:22:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2022-11-25 23:22:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 10048. [2022-11-25 23:22:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10048 states, 9523 states have (on average 3.845111834505933) internal successors, (36617), 10047 states have internal predecessors, (36617), 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-25 23:22:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10048 states to 10048 states and 36617 transitions. [2022-11-25 23:22:21,746 INFO L78 Accepts]: Start accepts. Automaton has 10048 states and 36617 transitions. Word has length 5 [2022-11-25 23:22:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:21,748 INFO L495 AbstractCegarLoop]: Abstraction has 10048 states and 36617 transitions. [2022-11-25 23:22:21,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 10048 states and 36617 transitions. [2022-11-25 23:22:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:22:21,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:21,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:22:21,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:22:21,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1081144194, now seen corresponding path program 1 times [2022-11-25 23:22:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:21,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46943705] [2022-11-25 23:22:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:21,909 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-25 23:22:21,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:21,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46943705] [2022-11-25 23:22:21,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46943705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:21,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:21,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:22:21,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087471695] [2022-11-25 23:22:21,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:21,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:22:21,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:21,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:22:21,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:22:21,913 INFO L87 Difference]: Start difference. First operand 10048 states and 36617 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:22,042 INFO L93 Difference]: Finished difference Result 3972 states and 12888 transitions. [2022-11-25 23:22:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:22:22,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:22:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:22,064 INFO L225 Difference]: With dead ends: 3972 [2022-11-25 23:22:22,064 INFO L226 Difference]: Without dead ends: 3842 [2022-11-25 23:22:22,065 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-25 23:22:22,065 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:22,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2022-11-25 23:22:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 3661. [2022-11-25 23:22:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 3587 states have (on average 3.3267354335098966) internal successors, (11933), 3660 states have internal predecessors, (11933), 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-25 23:22:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 11933 transitions. [2022-11-25 23:22:22,271 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 11933 transitions. Word has length 5 [2022-11-25 23:22:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:22,272 INFO L495 AbstractCegarLoop]: Abstraction has 3661 states and 11933 transitions. [2022-11-25 23:22:22,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 11933 transitions. [2022-11-25 23:22:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:22:22,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:22,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:22,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:22:22,274 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:22,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1959111245, now seen corresponding path program 1 times [2022-11-25 23:22:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:22,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583647779] [2022-11-25 23:22:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:22,454 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-25 23:22:22,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:22,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583647779] [2022-11-25 23:22:22,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583647779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:22,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:22,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:22:22,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313062065] [2022-11-25 23:22:22,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:22,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:22:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:22:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:22:22,457 INFO L87 Difference]: Start difference. First operand 3661 states and 11933 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-25 23:22:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:22,601 INFO L93 Difference]: Finished difference Result 3611 states and 11753 transitions. [2022-11-25 23:22:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:22:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-25 23:22:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:22,618 INFO L225 Difference]: With dead ends: 3611 [2022-11-25 23:22:22,618 INFO L226 Difference]: Without dead ends: 3611 [2022-11-25 23:22:22,619 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-25 23:22:22,619 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:22,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2022-11-25 23:22:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3611. [2022-11-25 23:22:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 3537 states have (on average 3.322872490811422) internal successors, (11753), 3610 states have internal predecessors, (11753), 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-25 23:22:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 11753 transitions. [2022-11-25 23:22:22,716 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 11753 transitions. Word has length 10 [2022-11-25 23:22:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:22,717 INFO L495 AbstractCegarLoop]: Abstraction has 3611 states and 11753 transitions. [2022-11-25 23:22:22,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-25 23:22:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 11753 transitions. [2022-11-25 23:22:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:22:22,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:22,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:22,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:22:22,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:22,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash -616864965, now seen corresponding path program 1 times [2022-11-25 23:22:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:22,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696487758] [2022-11-25 23:22:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:23,015 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-25 23:22:23,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:23,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696487758] [2022-11-25 23:22:23,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696487758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:23,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:23,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:22:23,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228611675] [2022-11-25 23:22:23,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:23,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:22:23,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:23,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:22:23,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:22:23,018 INFO L87 Difference]: Start difference. First operand 3611 states and 11753 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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-25 23:22:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:23,265 INFO L93 Difference]: Finished difference Result 4049 states and 12843 transitions. [2022-11-25 23:22:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:22:23,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-25 23:22:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:23,283 INFO L225 Difference]: With dead ends: 4049 [2022-11-25 23:22:23,283 INFO L226 Difference]: Without dead ends: 4049 [2022-11-25 23:22:23,283 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-25 23:22:23,284 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:23,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:22:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4049 states. [2022-11-25 23:22:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4049 to 3511. [2022-11-25 23:22:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3438 states have (on average 3.3211169284467714) internal successors, (11418), 3510 states have internal predecessors, (11418), 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-25 23:22:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 11418 transitions. [2022-11-25 23:22:23,381 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 11418 transitions. Word has length 11 [2022-11-25 23:22:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:23,382 INFO L495 AbstractCegarLoop]: Abstraction has 3511 states and 11418 transitions. [2022-11-25 23:22:23,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-25 23:22:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 11418 transitions. [2022-11-25 23:22:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:22:23,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:23,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:23,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:22:23,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:23,384 INFO L85 PathProgramCache]: Analyzing trace with hash -616864964, now seen corresponding path program 1 times [2022-11-25 23:22:23,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:23,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954375997] [2022-11-25 23:22:23,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:23,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:23,712 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-25 23:22:23,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:23,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954375997] [2022-11-25 23:22:23,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954375997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:23,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:23,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:22:23,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12373341] [2022-11-25 23:22:23,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:23,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:22:23,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:23,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:22:23,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:22:23,715 INFO L87 Difference]: Start difference. First operand 3511 states and 11418 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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-25 23:22:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:23,891 INFO L93 Difference]: Finished difference Result 5949 states and 19328 transitions. [2022-11-25 23:22:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:22:23,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-25 23:22:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:23,917 INFO L225 Difference]: With dead ends: 5949 [2022-11-25 23:22:23,917 INFO L226 Difference]: Without dead ends: 5949 [2022-11-25 23:22:23,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:22:23,920 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 58 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:23,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 5 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2022-11-25 23:22:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3751. [2022-11-25 23:22:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3678 states have (on average 3.3143012506797174) internal successors, (12190), 3750 states have internal predecessors, (12190), 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-25 23:22:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 12190 transitions. [2022-11-25 23:22:24,044 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 12190 transitions. Word has length 11 [2022-11-25 23:22:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:24,044 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 12190 transitions. [2022-11-25 23:22:24,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-25 23:22:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 12190 transitions. [2022-11-25 23:22:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:22:24,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:24,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:24,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:22:24,052 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:24,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash -602911692, now seen corresponding path program 1 times [2022-11-25 23:22:24,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:24,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750391732] [2022-11-25 23:22:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:24,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:24,286 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-25 23:22:24,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:24,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750391732] [2022-11-25 23:22:24,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750391732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:24,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:24,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:22:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990145047] [2022-11-25 23:22:24,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:24,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:22:24,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:22:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:22:24,289 INFO L87 Difference]: Start difference. First operand 3751 states and 12190 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-25 23:22:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:24,418 INFO L93 Difference]: Finished difference Result 3731 states and 12110 transitions. [2022-11-25 23:22:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:22:24,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-25 23:22:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:24,434 INFO L225 Difference]: With dead ends: 3731 [2022-11-25 23:22:24,434 INFO L226 Difference]: Without dead ends: 3731 [2022-11-25 23:22:24,435 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-25 23:22:24,436 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:24,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:24,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2022-11-25 23:22:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 3731. [2022-11-25 23:22:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3658 states have (on average 3.3105522143247677) internal successors, (12110), 3730 states have internal predecessors, (12110), 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-25 23:22:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 12110 transitions. [2022-11-25 23:22:24,544 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 12110 transitions. Word has length 11 [2022-11-25 23:22:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:24,544 INFO L495 AbstractCegarLoop]: Abstraction has 3731 states and 12110 transitions. [2022-11-25 23:22:24,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-25 23:22:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 12110 transitions. [2022-11-25 23:22:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:22:24,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:24,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:24,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:22:24,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:24,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1489357562, now seen corresponding path program 2 times [2022-11-25 23:22:24,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:24,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808276112] [2022-11-25 23:22:24,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:24,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:25,139 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-25 23:22:25,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:25,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808276112] [2022-11-25 23:22:25,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808276112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:25,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:25,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:22:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480586359] [2022-11-25 23:22:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:25,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:22:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:25,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:22:25,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:22:25,142 INFO L87 Difference]: Start difference. First operand 3731 states and 12110 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-25 23:22:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:25,482 INFO L93 Difference]: Finished difference Result 4169 states and 13200 transitions. [2022-11-25 23:22:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:22:25,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-25 23:22:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:25,503 INFO L225 Difference]: With dead ends: 4169 [2022-11-25 23:22:25,503 INFO L226 Difference]: Without dead ends: 4169 [2022-11-25 23:22:25,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:22:25,504 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:25,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 10 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:22:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2022-11-25 23:22:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 3391. [2022-11-25 23:22:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3391 states, 3319 states have (on average 3.315155167219042) internal successors, (11003), 3390 states have internal predecessors, (11003), 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-25 23:22:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 11003 transitions. [2022-11-25 23:22:25,629 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 11003 transitions. Word has length 11 [2022-11-25 23:22:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:25,629 INFO L495 AbstractCegarLoop]: Abstraction has 3391 states and 11003 transitions. [2022-11-25 23:22:25,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-25 23:22:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 11003 transitions. [2022-11-25 23:22:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:22:25,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:25,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:25,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:22:25,632 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash -101910741, now seen corresponding path program 1 times [2022-11-25 23:22:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:25,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288642713] [2022-11-25 23:22:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:25,896 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-25 23:22:25,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:25,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288642713] [2022-11-25 23:22:25,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288642713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:25,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:25,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:22:25,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548207942] [2022-11-25 23:22:25,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:25,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:22:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:25,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:22:25,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:22:25,899 INFO L87 Difference]: Start difference. First operand 3391 states and 11003 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-25 23:22:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:26,036 INFO L93 Difference]: Finished difference Result 3370 states and 10929 transitions. [2022-11-25 23:22:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:22:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-11-25 23:22:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:26,054 INFO L225 Difference]: With dead ends: 3370 [2022-11-25 23:22:26,054 INFO L226 Difference]: Without dead ends: 3370 [2022-11-25 23:22:26,054 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-25 23:22:26,055 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:26,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-11-25 23:22:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 3370. [2022-11-25 23:22:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 3298 states have (on average 3.3138265615524563) internal successors, (10929), 3369 states have internal predecessors, (10929), 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-25 23:22:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 10929 transitions. [2022-11-25 23:22:26,171 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 10929 transitions. Word has length 13 [2022-11-25 23:22:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:26,172 INFO L495 AbstractCegarLoop]: Abstraction has 3370 states and 10929 transitions. [2022-11-25 23:22:26,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-25 23:22:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 10929 transitions. [2022-11-25 23:22:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:22:26,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:26,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:26,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:22:26,175 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:26,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:26,176 INFO L85 PathProgramCache]: Analyzing trace with hash 422461384, now seen corresponding path program 1 times [2022-11-25 23:22:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:26,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081612581] [2022-11-25 23:22:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:26,408 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-25 23:22:26,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:26,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081612581] [2022-11-25 23:22:26,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081612581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:26,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:26,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:22:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60530536] [2022-11-25 23:22:26,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:26,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:22:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:22:26,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:22:26,411 INFO L87 Difference]: Start difference. First operand 3370 states and 10929 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-25 23:22:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:26,607 INFO L93 Difference]: Finished difference Result 3138 states and 9721 transitions. [2022-11-25 23:22:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:22:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-11-25 23:22:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:26,624 INFO L225 Difference]: With dead ends: 3138 [2022-11-25 23:22:26,625 INFO L226 Difference]: Without dead ends: 3138 [2022-11-25 23:22:26,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:22:26,626 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 46 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:26,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 10 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:22:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2022-11-25 23:22:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2812. [2022-11-25 23:22:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2740 states have (on average 3.281021897810219) internal successors, (8990), 2811 states have internal predecessors, (8990), 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-25 23:22:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 8990 transitions. [2022-11-25 23:22:26,731 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 8990 transitions. Word has length 13 [2022-11-25 23:22:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:26,731 INFO L495 AbstractCegarLoop]: Abstraction has 2812 states and 8990 transitions. [2022-11-25 23:22:26,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-25 23:22:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 8990 transitions. [2022-11-25 23:22:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:22:26,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:26,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:26,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:22:26,734 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1135733548, now seen corresponding path program 1 times [2022-11-25 23:22:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:26,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925138176] [2022-11-25 23:22:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:26,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:27,036 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-25 23:22:27,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:27,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925138176] [2022-11-25 23:22:27,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925138176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:27,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:27,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:22:27,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332049977] [2022-11-25 23:22:27,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:27,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:22:27,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:27,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:22:27,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:22:27,041 INFO L87 Difference]: Start difference. First operand 2812 states and 8990 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:27,328 INFO L93 Difference]: Finished difference Result 6165 states and 19318 transitions. [2022-11-25 23:22:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:22:27,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:22:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:27,359 INFO L225 Difference]: With dead ends: 6165 [2022-11-25 23:22:27,360 INFO L226 Difference]: Without dead ends: 6165 [2022-11-25 23:22:27,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 23:22:27,361 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 75 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:27,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 7 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:22:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6165 states. [2022-11-25 23:22:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6165 to 3046. [2022-11-25 23:22:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3046 states, 2974 states have (on average 3.2649630127774043) internal successors, (9710), 3045 states have internal predecessors, (9710), 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-25 23:22:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 9710 transitions. [2022-11-25 23:22:27,493 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 9710 transitions. Word has length 14 [2022-11-25 23:22:27,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:27,493 INFO L495 AbstractCegarLoop]: Abstraction has 3046 states and 9710 transitions. [2022-11-25 23:22:27,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 9710 transitions. [2022-11-25 23:22:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:22:27,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:27,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:27,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:22:27,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1050028952, now seen corresponding path program 1 times [2022-11-25 23:22:27,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:27,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390939000] [2022-11-25 23:22:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:27,770 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-25 23:22:27,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390939000] [2022-11-25 23:22:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390939000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:27,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:27,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:22:27,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113652079] [2022-11-25 23:22:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:27,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:22:27,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:27,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:22:27,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:22:27,773 INFO L87 Difference]: Start difference. First operand 3046 states and 9710 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:27,896 INFO L93 Difference]: Finished difference Result 3034 states and 9666 transitions. [2022-11-25 23:22:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:22:27,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:22:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:27,908 INFO L225 Difference]: With dead ends: 3034 [2022-11-25 23:22:27,908 INFO L226 Difference]: Without dead ends: 3034 [2022-11-25 23:22:27,909 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-25 23:22:27,909 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:27,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2022-11-25 23:22:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 3034. [2022-11-25 23:22:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 2962 states have (on average 3.263335584064821) internal successors, (9666), 3033 states have internal predecessors, (9666), 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-25 23:22:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 9666 transitions. [2022-11-25 23:22:27,978 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 9666 transitions. Word has length 14 [2022-11-25 23:22:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:27,978 INFO L495 AbstractCegarLoop]: Abstraction has 3034 states and 9666 transitions. [2022-11-25 23:22:27,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:27,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 9666 transitions. [2022-11-25 23:22:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:22:27,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:27,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:27,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:22:27,981 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 211402385, now seen corresponding path program 1 times [2022-11-25 23:22:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:27,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432836406] [2022-11-25 23:22:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:27,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:28,292 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-25 23:22:28,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:28,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432836406] [2022-11-25 23:22:28,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432836406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:28,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:28,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:22:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245548252] [2022-11-25 23:22:28,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:28,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:22:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:22:28,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:22:28,295 INFO L87 Difference]: Start difference. First operand 3034 states and 9666 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:28,529 INFO L93 Difference]: Finished difference Result 2734 states and 7846 transitions. [2022-11-25 23:22:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:22:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:22:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:28,541 INFO L225 Difference]: With dead ends: 2734 [2022-11-25 23:22:28,541 INFO L226 Difference]: Without dead ends: 2734 [2022-11-25 23:22:28,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:22:28,544 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 72 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:28,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 12 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:22:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2022-11-25 23:22:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2476. [2022-11-25 23:22:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2404 states have (on average 2.9821131447587352) internal successors, (7169), 2475 states have internal predecessors, (7169), 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-25 23:22:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 7169 transitions. [2022-11-25 23:22:28,623 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 7169 transitions. Word has length 14 [2022-11-25 23:22:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:28,623 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 7169 transitions. [2022-11-25 23:22:28,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 7169 transitions. [2022-11-25 23:22:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:22:28,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:28,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:28,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:22:28,626 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:28,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash 211402452, now seen corresponding path program 1 times [2022-11-25 23:22:28,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:28,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868129651] [2022-11-25 23:22:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:29,181 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-25 23:22:29,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:29,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868129651] [2022-11-25 23:22:29,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868129651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:29,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:29,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:22:29,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059583116] [2022-11-25 23:22:29,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:29,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:22:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:29,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:22:29,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:22:29,187 INFO L87 Difference]: Start difference. First operand 2476 states and 7169 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:29,752 INFO L93 Difference]: Finished difference Result 1804 states and 5352 transitions. [2022-11-25 23:22:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:22:29,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:22:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:29,759 INFO L225 Difference]: With dead ends: 1804 [2022-11-25 23:22:29,759 INFO L226 Difference]: Without dead ends: 1756 [2022-11-25 23:22:29,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:22:29,760 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:29,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 37 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:22:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-11-25 23:22:29,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1756. [2022-11-25 23:22:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1720 states have (on average 2.9906976744186045) internal successors, (5144), 1755 states have internal predecessors, (5144), 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-25 23:22:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 5144 transitions. [2022-11-25 23:22:29,812 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 5144 transitions. Word has length 14 [2022-11-25 23:22:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:29,812 INFO L495 AbstractCegarLoop]: Abstraction has 1756 states and 5144 transitions. [2022-11-25 23:22:29,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 5144 transitions. [2022-11-25 23:22:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:22:29,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:29,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:29,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:22:29,815 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:29,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1690645792, now seen corresponding path program 1 times [2022-11-25 23:22:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:29,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362095563] [2022-11-25 23:22:29,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:30,086 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-25 23:22:30,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:30,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362095563] [2022-11-25 23:22:30,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362095563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:30,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:30,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:22:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446766656] [2022-11-25 23:22:30,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:30,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:22:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:30,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:22:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:22:30,096 INFO L87 Difference]: Start difference. First operand 1756 states and 5144 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-25 23:22:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:30,266 INFO L93 Difference]: Finished difference Result 2544 states and 7337 transitions. [2022-11-25 23:22:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:22:30,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-25 23:22:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:30,276 INFO L225 Difference]: With dead ends: 2544 [2022-11-25 23:22:30,276 INFO L226 Difference]: Without dead ends: 2520 [2022-11-25 23:22:30,276 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-25 23:22:30,277 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 56 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:30,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2022-11-25 23:22:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1753. [2022-11-25 23:22:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1717 states have (on average 2.9895165987186956) internal successors, (5133), 1752 states have internal predecessors, (5133), 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-25 23:22:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 5133 transitions. [2022-11-25 23:22:30,336 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 5133 transitions. Word has length 15 [2022-11-25 23:22:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:30,336 INFO L495 AbstractCegarLoop]: Abstraction has 1753 states and 5133 transitions. [2022-11-25 23:22:30,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-25 23:22:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 5133 transitions. [2022-11-25 23:22:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:22:30,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:30,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:30,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 23:22:30,340 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2036456653, now seen corresponding path program 1 times [2022-11-25 23:22:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:30,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543431326] [2022-11-25 23:22:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:30,454 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-25 23:22:30,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:30,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543431326] [2022-11-25 23:22:30,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543431326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:30,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:30,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:22:30,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534503573] [2022-11-25 23:22:30,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:30,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:22:30,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:30,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:22:30,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:22:30,457 INFO L87 Difference]: Start difference. First operand 1753 states and 5133 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-25 23:22:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:30,559 INFO L93 Difference]: Finished difference Result 1599 states and 4954 transitions. [2022-11-25 23:22:30,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:22:30,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-25 23:22:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:30,561 INFO L225 Difference]: With dead ends: 1599 [2022-11-25 23:22:30,561 INFO L226 Difference]: Without dead ends: 400 [2022-11-25 23:22:30,562 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-25 23:22:30,562 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 47 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:30,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-25 23:22:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 383. [2022-11-25 23:22:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 2.7277486910994764) internal successors, (1042), 382 states have internal predecessors, (1042), 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-25 23:22:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1042 transitions. [2022-11-25 23:22:30,573 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1042 transitions. Word has length 15 [2022-11-25 23:22:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:30,574 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 1042 transitions. [2022-11-25 23:22:30,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-25 23:22:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1042 transitions. [2022-11-25 23:22:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:22:30,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:30,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:30,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:22:30,576 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash 516412017, now seen corresponding path program 1 times [2022-11-25 23:22:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:30,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599795409] [2022-11-25 23:22:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:32,555 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-25 23:22:32,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:32,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599795409] [2022-11-25 23:22:32,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599795409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:32,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:32,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 23:22:32,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726800002] [2022-11-25 23:22:32,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:32,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:22:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:32,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:22:32,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:22:32,559 INFO L87 Difference]: Start difference. First operand 383 states and 1042 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-25 23:22:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:33,009 INFO L93 Difference]: Finished difference Result 402 states and 1103 transitions. [2022-11-25 23:22:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:22:33,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2022-11-25 23:22:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:33,012 INFO L225 Difference]: With dead ends: 402 [2022-11-25 23:22:33,012 INFO L226 Difference]: Without dead ends: 402 [2022-11-25 23:22:33,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:22:33,013 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:33,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 16 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:22:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-11-25 23:22:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2022-11-25 23:22:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.748110831234257) internal successors, (1091), 397 states have internal predecessors, (1091), 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-25 23:22:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1091 transitions. [2022-11-25 23:22:33,026 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1091 transitions. Word has length 16 [2022-11-25 23:22:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:33,027 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 1091 transitions. [2022-11-25 23:22:33,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-25 23:22:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1091 transitions. [2022-11-25 23:22:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:22:33,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:33,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:33,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:22:33,029 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:33,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1200850955, now seen corresponding path program 1 times [2022-11-25 23:22:33,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:33,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539868979] [2022-11-25 23:22:33,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:35,982 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-25 23:22:35,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:35,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539868979] [2022-11-25 23:22:35,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539868979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:35,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:35,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:22:35,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332533078] [2022-11-25 23:22:35,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:35,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:22:35,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:35,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:22:35,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:22:35,985 INFO L87 Difference]: Start difference. First operand 398 states and 1091 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-25 23:22:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:36,628 INFO L93 Difference]: Finished difference Result 450 states and 1247 transitions. [2022-11-25 23:22:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:22:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 17 [2022-11-25 23:22:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:36,630 INFO L225 Difference]: With dead ends: 450 [2022-11-25 23:22:36,630 INFO L226 Difference]: Without dead ends: 450 [2022-11-25 23:22:36,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:22:36,631 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:36,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 18 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:22:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-11-25 23:22:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 402. [2022-11-25 23:22:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 2.7256857855361596) internal successors, (1093), 401 states have internal predecessors, (1093), 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-25 23:22:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1093 transitions. [2022-11-25 23:22:36,644 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1093 transitions. Word has length 17 [2022-11-25 23:22:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:36,644 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 1093 transitions. [2022-11-25 23:22:36,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-25 23:22:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1093 transitions. [2022-11-25 23:22:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:22:36,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:36,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:36,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 23:22:36,647 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:36,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2059825967, now seen corresponding path program 1 times [2022-11-25 23:22:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:36,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138885840] [2022-11-25 23:22:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:36,918 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-25 23:22:36,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:36,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138885840] [2022-11-25 23:22:36,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138885840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:36,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:36,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:22:36,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487719483] [2022-11-25 23:22:36,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:36,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:22:36,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:36,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:22:36,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:22:36,923 INFO L87 Difference]: Start difference. First operand 402 states and 1093 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-25 23:22:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:37,029 INFO L93 Difference]: Finished difference Result 517 states and 1404 transitions. [2022-11-25 23:22:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:22:37,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-11-25 23:22:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:37,031 INFO L225 Difference]: With dead ends: 517 [2022-11-25 23:22:37,031 INFO L226 Difference]: Without dead ends: 213 [2022-11-25 23:22:37,031 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-25 23:22:37,032 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:37,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-25 23:22:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-11-25 23:22:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.6273584905660377) internal successors, (557), 212 states have internal predecessors, (557), 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-25 23:22:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 557 transitions. [2022-11-25 23:22:37,037 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 557 transitions. Word has length 17 [2022-11-25 23:22:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:37,037 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 557 transitions. [2022-11-25 23:22:37,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-25 23:22:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 557 transitions. [2022-11-25 23:22:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:22:37,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:37,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:37,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 23:22:37,038 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1944403887, now seen corresponding path program 1 times [2022-11-25 23:22:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:37,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463296259] [2022-11-25 23:22:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:39,565 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-25 23:22:39,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:39,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463296259] [2022-11-25 23:22:39,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463296259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:39,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:39,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 23:22:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579669821] [2022-11-25 23:22:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:39,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:22:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:22:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:22:39,567 INFO L87 Difference]: Start difference. First operand 213 states and 557 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:40,039 INFO L93 Difference]: Finished difference Result 216 states and 565 transitions. [2022-11-25 23:22:40,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:22:40,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:22:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:40,040 INFO L225 Difference]: With dead ends: 216 [2022-11-25 23:22:40,041 INFO L226 Difference]: Without dead ends: 216 [2022-11-25 23:22:40,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:22:40,041 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:40,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:22:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-25 23:22:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2022-11-25 23:22:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.6291079812206575) internal successors, (560), 213 states have internal predecessors, (560), 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-25 23:22:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 560 transitions. [2022-11-25 23:22:40,047 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 560 transitions. Word has length 18 [2022-11-25 23:22:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:40,047 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 560 transitions. [2022-11-25 23:22:40,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 560 transitions. [2022-11-25 23:22:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:22:40,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:40,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:40,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 23:22:40,049 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:40,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1944404724, now seen corresponding path program 1 times [2022-11-25 23:22:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:40,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928874383] [2022-11-25 23:22:40,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:40,476 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-25 23:22:40,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:40,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928874383] [2022-11-25 23:22:40,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928874383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:40,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:40,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:22:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884990406] [2022-11-25 23:22:40,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:40,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:22:40,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:40,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:22:40,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:22:40,479 INFO L87 Difference]: Start difference. First operand 214 states and 560 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:40,545 INFO L93 Difference]: Finished difference Result 159 states and 360 transitions. [2022-11-25 23:22:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:22:40,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:22:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:40,546 INFO L225 Difference]: With dead ends: 159 [2022-11-25 23:22:40,546 INFO L226 Difference]: Without dead ends: 159 [2022-11-25 23:22:40,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-25 23:22:40,547 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:40,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-25 23:22:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-11-25 23:22:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.278481012658228) internal successors, (360), 158 states have internal predecessors, (360), 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-25 23:22:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 360 transitions. [2022-11-25 23:22:40,551 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 360 transitions. Word has length 18 [2022-11-25 23:22:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:40,551 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 360 transitions. [2022-11-25 23:22:40,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 360 transitions. [2022-11-25 23:22:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:22:40,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:40,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:40,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 23:22:40,552 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:40,553 INFO L85 PathProgramCache]: Analyzing trace with hash 272075075, now seen corresponding path program 1 times [2022-11-25 23:22:40,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:40,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379353130] [2022-11-25 23:22:40,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:42,677 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-25 23:22:42,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:42,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379353130] [2022-11-25 23:22:42,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379353130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:42,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:42,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 23:22:42,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832369642] [2022-11-25 23:22:42,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:42,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:22:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:42,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:22:42,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:22:42,679 INFO L87 Difference]: Start difference. First operand 159 states and 360 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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-25 23:22:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:43,366 INFO L93 Difference]: Finished difference Result 177 states and 406 transitions. [2022-11-25 23:22:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:22:43,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 19 [2022-11-25 23:22:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:43,367 INFO L225 Difference]: With dead ends: 177 [2022-11-25 23:22:43,367 INFO L226 Difference]: Without dead ends: 177 [2022-11-25 23:22:43,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:22:43,368 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 55 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:43,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 9 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:22:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-25 23:22:43,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2022-11-25 23:22:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.3216374269005846) internal successors, (397), 171 states have internal predecessors, (397), 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-25 23:22:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 397 transitions. [2022-11-25 23:22:43,371 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 397 transitions. Word has length 19 [2022-11-25 23:22:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:43,372 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 397 transitions. [2022-11-25 23:22:43,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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-25 23:22:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 397 transitions. [2022-11-25 23:22:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:22:43,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:43,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:43,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 23:22:43,373 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash -122679403, now seen corresponding path program 2 times [2022-11-25 23:22:43,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:43,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158349793] [2022-11-25 23:22:43,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:43,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:45,763 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-25 23:22:45,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:45,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158349793] [2022-11-25 23:22:45,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158349793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:45,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:45,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:22:45,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380239163] [2022-11-25 23:22:45,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:45,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:22:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:45,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:22:45,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:22:45,766 INFO L87 Difference]: Start difference. First operand 172 states and 397 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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-25 23:22:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:46,216 INFO L93 Difference]: Finished difference Result 181 states and 418 transitions. [2022-11-25 23:22:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:22:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 19 [2022-11-25 23:22:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:46,217 INFO L225 Difference]: With dead ends: 181 [2022-11-25 23:22:46,217 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 23:22:46,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:22:46,218 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:46,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:22:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 23:22:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2022-11-25 23:22:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.3072289156626504) internal successors, (383), 166 states have internal predecessors, (383), 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-25 23:22:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 383 transitions. [2022-11-25 23:22:46,222 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 383 transitions. Word has length 19 [2022-11-25 23:22:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:46,222 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 383 transitions. [2022-11-25 23:22:46,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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-25 23:22:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 383 transitions. [2022-11-25 23:22:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:22:46,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:46,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:46,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 23:22:46,223 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:46,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash -148061335, now seen corresponding path program 1 times [2022-11-25 23:22:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:46,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141850276] [2022-11-25 23:22:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:46,778 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-25 23:22:46,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:46,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141850276] [2022-11-25 23:22:46,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141850276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:46,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:46,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:22:46,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371771799] [2022-11-25 23:22:46,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:46,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:22:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:46,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:22:46,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:22:46,781 INFO L87 Difference]: Start difference. First operand 167 states and 383 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-25 23:22:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:46,868 INFO L93 Difference]: Finished difference Result 106 states and 204 transitions. [2022-11-25 23:22:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:22:46,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-11-25 23:22:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:46,869 INFO L225 Difference]: With dead ends: 106 [2022-11-25 23:22:46,870 INFO L226 Difference]: Without dead ends: 106 [2022-11-25 23:22:46,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:22:46,870 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:46,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-25 23:22:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-25 23:22:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.9428571428571428) internal successors, (204), 105 states have internal predecessors, (204), 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-25 23:22:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 204 transitions. [2022-11-25 23:22:46,873 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 204 transitions. Word has length 19 [2022-11-25 23:22:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:46,873 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 204 transitions. [2022-11-25 23:22:46,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-25 23:22:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 204 transitions. [2022-11-25 23:22:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:22:46,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:46,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:46,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 23:22:46,874 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:46,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2100212755, now seen corresponding path program 1 times [2022-11-25 23:22:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:46,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744471502] [2022-11-25 23:22:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:46,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:22:47,652 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-25 23:22:47,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:22:47,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744471502] [2022-11-25 23:22:47,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744471502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:22:47,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:22:47,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:22:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017927503] [2022-11-25 23:22:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:22:47,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:22:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:22:47,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:22:47,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:22:47,655 INFO L87 Difference]: Start difference. First operand 106 states and 204 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:22:47,760 INFO L93 Difference]: Finished difference Result 82 states and 156 transitions. [2022-11-25 23:22:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:22:47,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:22:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:22:47,761 INFO L225 Difference]: With dead ends: 82 [2022-11-25 23:22:47,761 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 23:22:47,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:22:47,761 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:22:47,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:22:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 23:22:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-11-25 23:22:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 75 states have internal predecessors, (143), 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-25 23:22:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 143 transitions. [2022-11-25 23:22:47,764 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 143 transitions. Word has length 21 [2022-11-25 23:22:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:22:47,764 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 143 transitions. [2022-11-25 23:22:47,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:22:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 143 transitions. [2022-11-25 23:22:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:22:47,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:22:47,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:47,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 23:22:47,765 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:22:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:22:47,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2052721774, now seen corresponding path program 1 times [2022-11-25 23:22:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:22:47,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103303868] [2022-11-25 23:22:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:22:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:22:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:22:47,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:22:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:22:48,061 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:22:48,062 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:22:48,063 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2022-11-25 23:22:48,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2022-11-25 23:22:48,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2022-11-25 23:22:48,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2022-11-25 23:22:48,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2022-11-25 23:22:48,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2022-11-25 23:22:48,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2022-11-25 23:22:48,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2022-11-25 23:22:48,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2022-11-25 23:22:48,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2022-11-25 23:22:48,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2022-11-25 23:22:48,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2022-11-25 23:22:48,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2022-11-25 23:22:48,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2022-11-25 23:22:48,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2022-11-25 23:22:48,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2022-11-25 23:22:48,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2022-11-25 23:22:48,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2022-11-25 23:22:48,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2022-11-25 23:22:48,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2022-11-25 23:22:48,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2022-11-25 23:22:48,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2022-11-25 23:22:48,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2022-11-25 23:22:48,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2022-11-25 23:22:48,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2022-11-25 23:22:48,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2022-11-25 23:22:48,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2022-11-25 23:22:48,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2022-11-25 23:22:48,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2022-11-25 23:22:48,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2022-11-25 23:22:48,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2022-11-25 23:22:48,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2022-11-25 23:22:48,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2022-11-25 23:22:48,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2022-11-25 23:22:48,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2022-11-25 23:22:48,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2022-11-25 23:22:48,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2022-11-25 23:22:48,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2022-11-25 23:22:48,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2022-11-25 23:22:48,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2022-11-25 23:22:48,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2022-11-25 23:22:48,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2022-11-25 23:22:48,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2022-11-25 23:22:48,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2022-11-25 23:22:48,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2022-11-25 23:22:48,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2022-11-25 23:22:48,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2022-11-25 23:22:48,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2022-11-25 23:22:48,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2022-11-25 23:22:48,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2022-11-25 23:22:48,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2022-11-25 23:22:48,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2022-11-25 23:22:48,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2022-11-25 23:22:48,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2022-11-25 23:22:48,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2022-11-25 23:22:48,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2022-11-25 23:22:48,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2022-11-25 23:22:48,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2022-11-25 23:22:48,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2022-11-25 23:22:48,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2022-11-25 23:22:48,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2022-11-25 23:22:48,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2022-11-25 23:22:48,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2022-11-25 23:22:48,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2022-11-25 23:22:48,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2022-11-25 23:22:48,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2022-11-25 23:22:48,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2022-11-25 23:22:48,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2022-11-25 23:22:48,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2022-11-25 23:22:48,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2022-11-25 23:22:48,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2022-11-25 23:22:48,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2022-11-25 23:22:48,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2022-11-25 23:22:48,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2022-11-25 23:22:48,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2022-11-25 23:22:48,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 23:22:48,085 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:22:48,092 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 23:22:48,092 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:22:48,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:22:48 BasicIcfg [2022-11-25 23:22:48,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:22:48,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:22:48,226 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:22:48,226 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:22:48,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:21:54" (3/4) ... [2022-11-25 23:22:48,229 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 23:22:48,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:22:48,230 INFO L158 Benchmark]: Toolchain (without parser) took 56384.34ms. Allocated memory was 151.0MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 118.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-25 23:22:48,230 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 111.1MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:22:48,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.67ms. Allocated memory is still 151.0MB. Free memory was 117.8MB in the beginning and 90.2MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 23:22:48,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.19ms. Allocated memory is still 151.0MB. Free memory was 90.2MB in the beginning and 87.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:22:48,231 INFO L158 Benchmark]: Boogie Preprocessor took 70.17ms. Allocated memory is still 151.0MB. Free memory was 87.6MB in the beginning and 85.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:22:48,232 INFO L158 Benchmark]: RCFGBuilder took 1614.51ms. Allocated memory is still 151.0MB. Free memory was 85.0MB in the beginning and 63.9MB in the end (delta: 21.1MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2022-11-25 23:22:48,234 INFO L158 Benchmark]: TraceAbstraction took 53881.48ms. Allocated memory was 151.0MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 62.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-25 23:22:48,235 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 3.4GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:22:48,238 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.25ms. Allocated memory is still 111.1MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.67ms. Allocated memory is still 151.0MB. Free memory was 117.8MB in the beginning and 90.2MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.19ms. Allocated memory is still 151.0MB. Free memory was 90.2MB in the beginning and 87.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.17ms. Allocated memory is still 151.0MB. Free memory was 87.6MB in the beginning and 85.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1614.51ms. Allocated memory is still 151.0MB. Free memory was 85.0MB in the beginning and 63.9MB in the end (delta: 21.1MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * TraceAbstraction took 53881.48ms. Allocated memory was 151.0MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 62.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 3.4GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.8s, 186 PlacesBefore, 82 PlacesAfterwards, 178 TransitionsBefore, 73 TransitionsAfterwards, 6624 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 158 TotalNumberOfCompositions, 34369 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8733, independent: 8119, independent conditional: 0, independent unconditional: 8119, dependent: 561, dependent conditional: 0, dependent unconditional: 561, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3485, independent: 3386, independent conditional: 0, independent unconditional: 3386, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3485, independent: 3211, independent conditional: 0, independent unconditional: 3211, dependent: 274, dependent conditional: 0, dependent unconditional: 274, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 274, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1412, independent: 707, independent conditional: 0, independent unconditional: 707, dependent: 577, dependent conditional: 0, dependent unconditional: 577, unknown: 128, unknown conditional: 0, unknown unconditional: 128] ], Cache Queries: [ total: 8733, independent: 4733, independent conditional: 0, independent unconditional: 4733, dependent: 468, dependent conditional: 0, dependent unconditional: 468, unknown: 3532, unknown conditional: 0, unknown unconditional: 3532] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 530, Positive conditional cache size: 0, Positive unconditional cache size: 530, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=-2, t1780={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1781; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={6:0}, t1781={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=-1, t1780={6:0}, t1781={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t1782; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=0, t1780={6:0}, t1781={7:0}, t1782={5:0}, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L825] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L760] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={6:0}, t1781={7:0}, t1782={5:0}, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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: -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: -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: -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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 233 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 53.5s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1037 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1037 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2949 IncrementalHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 71 mSDtfsCounter, 2949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35046occurred in iteration=0, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 10551 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 4767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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 could not prove your program: unable to determine feasibility of some traces [2022-11-25 23:22:48,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/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_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- 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-25 23:22:51,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:22:51,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:22:51,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:22:51,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:22:51,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:22:51,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:22:51,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:22:51,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:22:51,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:22:51,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:22:51,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:22:51,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:22:51,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:22:51,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:22:51,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:22:51,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:22:51,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:22:51,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:22:51,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:22:51,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:22:51,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:22:51,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:22:51,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:22:51,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:22:51,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:22:51,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:22:51,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:22:51,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:22:51,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:22:51,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:22:51,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:22:51,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:22:51,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:22:51,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:22:51,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:22:51,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:22:51,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:22:51,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:22:51,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:22:51,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:22:51,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 23:22:51,198 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:22:51,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:22:51,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:22:51,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:22:51,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:22:51,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:22:51,201 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:22:51,202 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:22:51,202 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:22:51,202 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:22:51,203 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:22:51,204 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:22:51,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:22:51,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:22:51,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:22:51,206 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:22:51,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:22:51,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:22:51,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:22:51,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:22:51,207 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:22:51,207 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:22:51,208 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:22:51,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:22:51,208 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:22:51,209 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 23:22:51,209 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 23:22:51,209 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:22:51,210 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:22:51,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:22:51,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 23:22:51,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:22:51,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:22:51,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:22:51,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:22:51,212 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 23:22:51,212 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 23:22:51,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:22:51,213 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 23:22:51,213 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/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_8da4393b-b9fc-45f6-a08e-185b94b42011/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2022-11-25 23:22:51,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:22:51,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:22:51,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:22:51,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:22:51,665 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:22:51,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-25 23:22:54,849 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:22:55,159 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:22:55,159 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-25 23:22:55,193 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/data/c36932f5f/5ba2727e0c344070bd737cde419a55e1/FLAGc7e5bfb66 [2022-11-25 23:22:55,222 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/data/c36932f5f/5ba2727e0c344070bd737cde419a55e1 [2022-11-25 23:22:55,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:22:55,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:22:55,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:22:55,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:22:55,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:22:55,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:22:55" (1/1) ... [2022-11-25 23:22:55,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fc86a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:55, skipping insertion in model container [2022-11-25 23:22:55,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:22:55" (1/1) ... [2022-11-25 23:22:55,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:22:55,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:22:55,548 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_8da4393b-b9fc-45f6-a08e-185b94b42011/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-25 23:22:55,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:22:55,829 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:22:55,850 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_8da4393b-b9fc-45f6-a08e-185b94b42011/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-25 23:22:55,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:22:55,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:22:55,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:22:56,004 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:22:56,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56 WrapperNode [2022-11-25 23:22:56,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:22:56,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:22:56,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:22:56,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:22:56,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,069 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-11-25 23:22:56,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:22:56,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:22:56,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:22:56,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:22:56,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,105 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:22:56,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:22:56,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:22:56,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:22:56,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (1/1) ... [2022-11-25 23:22:56,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:22:56,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:22:56,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:22:56,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:22:56,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 23:22:56,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 23:22:56,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:22:56,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:22:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:22:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 23:22:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 23:22:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-25 23:22:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 23:22:56,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 23:22:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 23:22:56,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 23:22:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 23:22:56,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 23:22:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 23:22:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:22:56,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:22:56,210 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:22:56,369 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:22:56,372 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:22:57,320 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:22:58,119 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:22:58,120 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:22:58,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:22:58 BoogieIcfgContainer [2022-11-25 23:22:58,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:22:58,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:22:58,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:22:58,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:22:58,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:22:55" (1/3) ... [2022-11-25 23:22:58,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f48163b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:22:58, skipping insertion in model container [2022-11-25 23:22:58,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:22:56" (2/3) ... [2022-11-25 23:22:58,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f48163b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:22:58, skipping insertion in model container [2022-11-25 23:22:58,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:22:58" (3/3) ... [2022-11-25 23:22:58,134 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2022-11-25 23:22:58,156 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:22:58,156 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-25 23:22:58,157 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:22:58,334 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 23:22:58,369 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:22:58,383 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 179 transitions, 373 flow [2022-11-25 23:22:58,386 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 179 transitions, 373 flow [2022-11-25 23:22:58,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 179 transitions, 373 flow [2022-11-25 23:22:58,474 INFO L130 PetriNetUnfolder]: 2/176 cut-off events. [2022-11-25 23:22:58,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 23:22:58,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 2/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 244 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-11-25 23:22:58,485 INFO L119 LiptonReduction]: Number of co-enabled transitions 6624 [2022-11-25 23:23:18,051 WARN L233 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 232 DAG size of output: 230 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 23:23:41,265 INFO L134 LiptonReduction]: Checked pairs total: 34323 [2022-11-25 23:23:41,266 INFO L136 LiptonReduction]: Total number of compositions: 153 [2022-11-25 23:23:41,273 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 73 transitions, 161 flow [2022-11-25 23:23:43,024 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-25 23:23:43,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:23:43,090 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;@1ff9f136, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:23:43,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-25 23:23:43,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 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-25 23:23:43,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-25 23:23:43,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:23:43,182 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-25 23:23:43,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:23:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:23:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1136, now seen corresponding path program 1 times [2022-11-25 23:23:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:23:43,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113552527] [2022-11-25 23:23:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:23:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:23:43,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:23:43,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 23:23:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:23:43,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 23:23:43,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:23:43,476 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-25 23:23:43,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:23:43,477 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:23:43,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113552527] [2022-11-25 23:23:43,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113552527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:23:43,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:23:43,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 23:23:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25852365] [2022-11-25 23:23:43,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:23:43,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:23:43,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:23:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:23:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:23:43,634 INFO L87 Difference]: Start difference. First operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-25 23:23:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:23:44,611 INFO L93 Difference]: Finished difference Result 15204 states and 54879 transitions. [2022-11-25 23:23:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:23:44,614 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-25 23:23:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:23:44,994 INFO L225 Difference]: With dead ends: 15204 [2022-11-25 23:23:44,994 INFO L226 Difference]: Without dead ends: 15204 [2022-11-25 23:23:44,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:23:45,014 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:23:45,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:23:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2022-11-25 23:23:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15204. [2022-11-25 23:23:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 13315 states have (on average 4.121592189260233) internal successors, (54879), 15203 states have internal predecessors, (54879), 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-25 23:23:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 54879 transitions. [2022-11-25 23:23:46,565 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 54879 transitions. Word has length 1 [2022-11-25 23:23:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:23:46,565 INFO L495 AbstractCegarLoop]: Abstraction has 15204 states and 54879 transitions. [2022-11-25 23:23:46,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-25 23:23:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 54879 transitions. [2022-11-25 23:23:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:23:46,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:23:46,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:23:46,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-25 23:23:46,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:46,783 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:23:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:23:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash 34847784, now seen corresponding path program 1 times [2022-11-25 23:23:46,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:23:46,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274856326] [2022-11-25 23:23:46,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:23:46,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:23:46,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:23:46,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 23:23:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:23:47,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:23:47,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:23:47,237 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-25 23:23:47,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:23:47,238 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:23:47,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274856326] [2022-11-25 23:23:47,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274856326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:23:47,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:23:47,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:23:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080649380] [2022-11-25 23:23:47,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:23:47,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:23:47,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:23:47,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:23:47,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:23:47,243 INFO L87 Difference]: Start difference. First operand 15204 states and 54879 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-25 23:23:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:23:48,097 INFO L93 Difference]: Finished difference Result 13683 states and 49236 transitions. [2022-11-25 23:23:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:23:48,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-25 23:23:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:23:48,197 INFO L225 Difference]: With dead ends: 13683 [2022-11-25 23:23:48,198 INFO L226 Difference]: Without dead ends: 13683 [2022-11-25 23:23:48,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-25 23:23:48,200 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:23:48,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:23:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2022-11-25 23:23:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 13683. [2022-11-25 23:23:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13683 states, 12109 states have (on average 4.066066562061277) internal successors, (49236), 13682 states have internal predecessors, (49236), 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-25 23:23:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 49236 transitions. [2022-11-25 23:23:49,089 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 49236 transitions. Word has length 4 [2022-11-25 23:23:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:23:49,090 INFO L495 AbstractCegarLoop]: Abstraction has 13683 states and 49236 transitions. [2022-11-25 23:23:49,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-25 23:23:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 49236 transitions. [2022-11-25 23:23:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:23:49,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:23:49,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:23:49,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:23:49,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:49,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:23:49,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:23:49,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1080282238, now seen corresponding path program 1 times [2022-11-25 23:23:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:23:49,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235812970] [2022-11-25 23:23:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:23:49,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:49,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:23:49,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:23:49,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 23:23:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:23:49,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:23:49,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:23:49,529 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-25 23:23:49,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:23:49,531 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:23:49,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235812970] [2022-11-25 23:23:49,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235812970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:23:49,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:23:49,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:23:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834644612] [2022-11-25 23:23:49,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:23:49,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:23:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:23:49,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:23:49,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:23:49,544 INFO L87 Difference]: Start difference. First operand 13683 states and 49236 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:23:50,384 INFO L93 Difference]: Finished difference Result 17556 states and 63266 transitions. [2022-11-25 23:23:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:23:50,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:23:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:23:50,536 INFO L225 Difference]: With dead ends: 17556 [2022-11-25 23:23:50,536 INFO L226 Difference]: Without dead ends: 17556 [2022-11-25 23:23:50,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 23:23:50,538 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:23:50,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:23:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17556 states. [2022-11-25 23:23:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17556 to 14790. [2022-11-25 23:23:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14790 states, 13280 states have (on average 4.209638554216867) internal successors, (55904), 14789 states have internal predecessors, (55904), 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-25 23:23:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14790 states to 14790 states and 55904 transitions. [2022-11-25 23:23:51,411 INFO L78 Accepts]: Start accepts. Automaton has 14790 states and 55904 transitions. Word has length 5 [2022-11-25 23:23:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:23:51,571 INFO L495 AbstractCegarLoop]: Abstraction has 14790 states and 55904 transitions. [2022-11-25 23:23:51,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 14790 states and 55904 transitions. [2022-11-25 23:23:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:23:51,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:23:51,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:23:51,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:23:51,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:51,773 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:23:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:23:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1080282240, now seen corresponding path program 1 times [2022-11-25 23:23:51,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:23:51,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582255367] [2022-11-25 23:23:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:23:51,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:51,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:23:51,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:23:51,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 23:23:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:23:51,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:23:51,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:23:52,046 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:23:52,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:23:52,124 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-25 23:23:52,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:23:52,125 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:23:52,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582255367] [2022-11-25 23:23:52,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582255367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:23:52,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:23:52,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:23:52,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420051893] [2022-11-25 23:23:52,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:23:52,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:23:52,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:23:52,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:23:52,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:23:52,128 INFO L87 Difference]: Start difference. First operand 14790 states and 55904 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:23:52,543 INFO L93 Difference]: Finished difference Result 8104 states and 29603 transitions. [2022-11-25 23:23:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:23:52,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:23:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:23:52,590 INFO L225 Difference]: With dead ends: 8104 [2022-11-25 23:23:52,591 INFO L226 Difference]: Without dead ends: 8104 [2022-11-25 23:23:52,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 23:23:52,708 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:23:52,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:23:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2022-11-25 23:23:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 8104. [2022-11-25 23:23:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8104 states, 7579 states have (on average 3.9059242644148306) internal successors, (29603), 8103 states have internal predecessors, (29603), 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-25 23:23:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8104 states to 8104 states and 29603 transitions. [2022-11-25 23:23:53,133 INFO L78 Accepts]: Start accepts. Automaton has 8104 states and 29603 transitions. Word has length 5 [2022-11-25 23:23:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:23:53,134 INFO L495 AbstractCegarLoop]: Abstraction has 8104 states and 29603 transitions. [2022-11-25 23:23:53,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 8104 states and 29603 transitions. [2022-11-25 23:23:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:23:53,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:23:53,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:23:53,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:23:53,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:53,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:23:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:23:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1080282241, now seen corresponding path program 1 times [2022-11-25 23:23:53,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:23:53,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798341407] [2022-11-25 23:23:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:23:53,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:23:53,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:23:53,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 23:23:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:23:53,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:23:53,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:23:53,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:23:53,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:23:53,733 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-25 23:23:53,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:23:53,733 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:23:53,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798341407] [2022-11-25 23:23:53,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798341407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:23:53,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:23:53,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:23:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121377360] [2022-11-25 23:23:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:23:53,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:23:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:23:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:23:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:23:53,737 INFO L87 Difference]: Start difference. First operand 8104 states and 29603 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:23:53,980 INFO L93 Difference]: Finished difference Result 2932 states and 10036 transitions. [2022-11-25 23:23:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:23:53,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:23:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:23:53,999 INFO L225 Difference]: With dead ends: 2932 [2022-11-25 23:23:53,999 INFO L226 Difference]: Without dead ends: 2932 [2022-11-25 23:23:54,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 23:23:54,001 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:23:54,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:23:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2022-11-25 23:23:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2801. [2022-11-25 23:23:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2727 states have (on average 3.523285661899523) internal successors, (9608), 2800 states have internal predecessors, (9608), 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-25 23:23:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 9608 transitions. [2022-11-25 23:23:54,120 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 9608 transitions. Word has length 5 [2022-11-25 23:23:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:23:54,121 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 9608 transitions. [2022-11-25 23:23:54,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 9608 transitions. [2022-11-25 23:23:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:23:54,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:23:54,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:23:54,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:23:54,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:54,337 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:23:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:23:54,337 INFO L85 PathProgramCache]: Analyzing trace with hash 782848170, now seen corresponding path program 1 times [2022-11-25 23:23:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:23:54,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659077924] [2022-11-25 23:23:54,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:23:54,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:23:54,340 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:23:54,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 23:23:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:23:54,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:23:54,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:23:54,598 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-25 23:23:54,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:23:54,598 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:23:54,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659077924] [2022-11-25 23:23:54,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659077924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:23:54,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:23:54,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:23:54,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498032517] [2022-11-25 23:23:54,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:23:54,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:23:54,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:23:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:23:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:23:54,602 INFO L87 Difference]: Start difference. First operand 2801 states and 9608 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-25 23:23:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:23:54,924 INFO L93 Difference]: Finished difference Result 1210 states and 3294 transitions. [2022-11-25 23:23:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:23:54,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-25 23:23:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:23:54,929 INFO L225 Difference]: With dead ends: 1210 [2022-11-25 23:23:54,929 INFO L226 Difference]: Without dead ends: 1210 [2022-11-25 23:23:54,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-25 23:23:54,930 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:23:54,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:23:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-11-25 23:23:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2022-11-25 23:23:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1160 states have (on average 2.839655172413793) internal successors, (3294), 1209 states have internal predecessors, (3294), 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-25 23:23:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3294 transitions. [2022-11-25 23:23:54,963 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3294 transitions. Word has length 10 [2022-11-25 23:23:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:23:54,964 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 3294 transitions. [2022-11-25 23:23:54,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-25 23:23:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3294 transitions. [2022-11-25 23:23:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:23:54,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:23:54,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:23:54,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-25 23:23:55,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:55,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:23:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:23:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1460915160, now seen corresponding path program 1 times [2022-11-25 23:23:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:23:55,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119112321] [2022-11-25 23:23:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:23:55,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:55,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:23:55,187 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:23:55,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 23:23:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:23:55,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:23:55,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:23:55,493 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-25 23:23:55,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:23:55,493 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:23:55,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119112321] [2022-11-25 23:23:55,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119112321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:23:55,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:23:55,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:23:55,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068645142] [2022-11-25 23:23:55,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:23:55,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:23:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:23:55,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:23:55,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:23:55,496 INFO L87 Difference]: Start difference. First operand 1210 states and 3294 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:23:55,849 INFO L93 Difference]: Finished difference Result 377 states and 828 transitions. [2022-11-25 23:23:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:23:55,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:23:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:23:55,851 INFO L225 Difference]: With dead ends: 377 [2022-11-25 23:23:55,851 INFO L226 Difference]: Without dead ends: 377 [2022-11-25 23:23:55,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:23:55,852 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:23:55,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:23:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-25 23:23:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-25 23:23:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 359 states have (on average 2.3064066852367686) internal successors, (828), 376 states have internal predecessors, (828), 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-25 23:23:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 828 transitions. [2022-11-25 23:23:55,860 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 828 transitions. Word has length 14 [2022-11-25 23:23:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:23:55,861 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 828 transitions. [2022-11-25 23:23:55,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 828 transitions. [2022-11-25 23:23:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:23:55,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:23:55,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:23:55,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:23:56,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:56,071 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:23:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:23:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1744767341, now seen corresponding path program 1 times [2022-11-25 23:23:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:23:56,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178964692] [2022-11-25 23:23:56,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:23:56,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:23:56,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:23:56,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 23:23:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:23:56,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:23:56,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:23:56,379 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-25 23:23:56,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:23:56,380 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:23:56,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178964692] [2022-11-25 23:23:56,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178964692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:23:56,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:23:56,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:23:56,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7449088] [2022-11-25 23:23:56,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:23:56,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:23:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:23:56,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:23:56,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:23:56,385 INFO L87 Difference]: Start difference. First operand 377 states and 828 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:23:56,833 INFO L93 Difference]: Finished difference Result 226 states and 533 transitions. [2022-11-25 23:23:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:23:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:23:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:23:56,835 INFO L225 Difference]: With dead ends: 226 [2022-11-25 23:23:56,835 INFO L226 Difference]: Without dead ends: 226 [2022-11-25 23:23:56,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:23:56,836 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:23:56,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:23:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-25 23:23:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-11-25 23:23:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 222 states have (on average 2.400900900900901) internal successors, (533), 225 states have internal predecessors, (533), 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-25 23:23:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 533 transitions. [2022-11-25 23:23:56,843 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 533 transitions. Word has length 18 [2022-11-25 23:23:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:23:56,844 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 533 transitions. [2022-11-25 23:23:56,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:23:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 533 transitions. [2022-11-25 23:23:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:23:56,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:23:56,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:23:56,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-25 23:23:57,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:57,060 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:23:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:23:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1903312709, now seen corresponding path program 1 times [2022-11-25 23:23:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:23:57,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367698608] [2022-11-25 23:23:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:23:57,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:23:57,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:23:57,063 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:23:57,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 23:23:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:23:57,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:23:57,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:24:03,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 152 [2022-11-25 23:24:03,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 23:24:03,291 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-25 23:24:03,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:24:03,291 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:24:03,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367698608] [2022-11-25 23:24:03,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367698608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:24:03,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:24:03,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:24:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673348081] [2022-11-25 23:24:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:24:03,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:24:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:24:03,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:24:03,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:24:03,293 INFO L87 Difference]: Start difference. First operand 226 states and 533 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:24:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:24:03,653 INFO L93 Difference]: Finished difference Result 225 states and 532 transitions. [2022-11-25 23:24:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:24:03,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 23:24:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:24:03,655 INFO L225 Difference]: With dead ends: 225 [2022-11-25 23:24:03,655 INFO L226 Difference]: Without dead ends: 225 [2022-11-25 23:24:03,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:24:03,657 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:24:03,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 7 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:24:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-25 23:24:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2022-11-25 23:24:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 222 states have (on average 2.3963963963963963) internal successors, (532), 224 states have internal predecessors, (532), 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-25 23:24:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 532 transitions. [2022-11-25 23:24:03,666 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 532 transitions. Word has length 22 [2022-11-25 23:24:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:24:03,666 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 532 transitions. [2022-11-25 23:24:03,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:24:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 532 transitions. [2022-11-25 23:24:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:24:03,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:24:03,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:24:03,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:24:03,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:24:03,887 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:24:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:24:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1903312708, now seen corresponding path program 1 times [2022-11-25 23:24:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:24:03,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798606785] [2022-11-25 23:24:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:24:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:24:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:24:03,891 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:24:03,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 23:24:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:24:04,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:24:04,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:24:22,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 152 [2022-11-25 23:24:22,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 23:24:23,099 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-25 23:24:23,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:24:23,100 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:24:23,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798606785] [2022-11-25 23:24:23,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798606785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:24:23,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:24:23,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:24:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806541370] [2022-11-25 23:24:23,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:24:23,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:24:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:24:23,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:24:23,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:24:23,102 INFO L87 Difference]: Start difference. First operand 225 states and 532 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:24:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:24:23,466 INFO L93 Difference]: Finished difference Result 224 states and 531 transitions. [2022-11-25 23:24:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:24:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 23:24:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:24:23,468 INFO L225 Difference]: With dead ends: 224 [2022-11-25 23:24:23,468 INFO L226 Difference]: Without dead ends: 224 [2022-11-25 23:24:23,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:24:23,470 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 44 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:24:23,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 7 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:24:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-25 23:24:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-11-25 23:24:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 2.391891891891892) internal successors, (531), 223 states have internal predecessors, (531), 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-25 23:24:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 531 transitions. [2022-11-25 23:24:23,477 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 531 transitions. Word has length 22 [2022-11-25 23:24:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:24:23,477 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 531 transitions. [2022-11-25 23:24:23,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:24:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 531 transitions. [2022-11-25 23:24:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:24:23,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:24:23,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:24:23,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:24:23,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:24:23,696 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:24:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:24:23,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1126842889, now seen corresponding path program 1 times [2022-11-25 23:24:23,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:24:23,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602614681] [2022-11-25 23:24:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:24:23,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:24:23,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:24:23,698 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:24:23,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 23:24:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:24:23,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:24:23,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:24:24,064 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-25 23:24:24,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:24:24,064 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:24:24,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602614681] [2022-11-25 23:24:24,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602614681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:24:24,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:24:24,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:24:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50863208] [2022-11-25 23:24:24,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:24:24,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:24:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:24:24,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:24:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:24:24,067 INFO L87 Difference]: Start difference. First operand 224 states and 531 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-25 23:24:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:24:24,356 INFO L93 Difference]: Finished difference Result 350 states and 815 transitions. [2022-11-25 23:24:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:24:24,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-11-25 23:24:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:24:24,357 INFO L225 Difference]: With dead ends: 350 [2022-11-25 23:24:24,358 INFO L226 Difference]: Without dead ends: 350 [2022-11-25 23:24:24,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-25 23:24:24,358 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:24:24,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:24:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-25 23:24:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 346. [2022-11-25 23:24:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 344 states have (on average 2.36046511627907) internal successors, (812), 345 states have internal predecessors, (812), 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-25 23:24:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 812 transitions. [2022-11-25 23:24:24,365 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 812 transitions. Word has length 23 [2022-11-25 23:24:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:24:24,365 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 812 transitions. [2022-11-25 23:24:24,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-25 23:24:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 812 transitions. [2022-11-25 23:24:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:24:24,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:24:24,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:24:24,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:24:24,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:24:24,567 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:24:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:24:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1230886505, now seen corresponding path program 2 times [2022-11-25 23:24:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:24:24,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013421026] [2022-11-25 23:24:24,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:24:24,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:24:24,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:24:24,569 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:24:24,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 23:24:24,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 23:24:24,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:24:24,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:24:24,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:24:24,908 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-25 23:24:24,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:24:24,909 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:24:24,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013421026] [2022-11-25 23:24:24,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013421026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:24:24,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:24:24,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:24:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665761528] [2022-11-25 23:24:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:24:24,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:24:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:24:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:24:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:24:24,912 INFO L87 Difference]: Start difference. First operand 346 states and 812 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-25 23:24:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:24:25,339 INFO L93 Difference]: Finished difference Result 519 states and 1154 transitions. [2022-11-25 23:24:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:24:25,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2022-11-25 23:24:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:24:25,341 INFO L225 Difference]: With dead ends: 519 [2022-11-25 23:24:25,341 INFO L226 Difference]: Without dead ends: 519 [2022-11-25 23:24:25,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:24:25,342 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:24:25,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:24:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-25 23:24:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 271. [2022-11-25 23:24:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 269 states have (on average 2.342007434944238) internal successors, (630), 270 states have internal predecessors, (630), 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-25 23:24:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 630 transitions. [2022-11-25 23:24:25,352 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 630 transitions. Word has length 23 [2022-11-25 23:24:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:24:25,353 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 630 transitions. [2022-11-25 23:24:25,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-25 23:24:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 630 transitions. [2022-11-25 23:24:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:24:25,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:24:25,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:24:25,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 23:24:25,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:24:25,571 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-25 23:24:25,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:24:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash -35433837, now seen corresponding path program 3 times [2022-11-25 23:24:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:24:25,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261542070] [2022-11-25 23:24:25,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:24:25,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:24:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:24:25,574 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:24:25,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 23:24:25,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 23:24:25,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 23:24:25,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:24:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:24:26,218 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-25 23:24:26,219 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:24:26,220 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2022-11-25 23:24:26,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2022-11-25 23:24:26,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2022-11-25 23:24:26,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2022-11-25 23:24:26,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2022-11-25 23:24:26,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2022-11-25 23:24:26,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2022-11-25 23:24:26,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2022-11-25 23:24:26,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2022-11-25 23:24:26,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2022-11-25 23:24:26,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2022-11-25 23:24:26,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2022-11-25 23:24:26,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2022-11-25 23:24:26,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2022-11-25 23:24:26,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2022-11-25 23:24:26,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2022-11-25 23:24:26,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2022-11-25 23:24:26,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2022-11-25 23:24:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2022-11-25 23:24:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2022-11-25 23:24:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2022-11-25 23:24:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2022-11-25 23:24:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2022-11-25 23:24:26,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2022-11-25 23:24:26,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2022-11-25 23:24:26,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2022-11-25 23:24:26,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2022-11-25 23:24:26,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2022-11-25 23:24:26,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2022-11-25 23:24:26,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2022-11-25 23:24:26,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2022-11-25 23:24:26,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2022-11-25 23:24:26,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2022-11-25 23:24:26,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2022-11-25 23:24:26,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2022-11-25 23:24:26,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2022-11-25 23:24:26,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2022-11-25 23:24:26,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2022-11-25 23:24:26,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2022-11-25 23:24:26,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2022-11-25 23:24:26,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2022-11-25 23:24:26,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2022-11-25 23:24:26,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2022-11-25 23:24:26,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2022-11-25 23:24:26,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2022-11-25 23:24:26,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2022-11-25 23:24:26,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2022-11-25 23:24:26,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2022-11-25 23:24:26,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2022-11-25 23:24:26,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2022-11-25 23:24:26,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2022-11-25 23:24:26,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2022-11-25 23:24:26,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2022-11-25 23:24:26,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2022-11-25 23:24:26,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2022-11-25 23:24:26,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2022-11-25 23:24:26,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2022-11-25 23:24:26,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2022-11-25 23:24:26,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2022-11-25 23:24:26,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2022-11-25 23:24:26,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2022-11-25 23:24:26,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2022-11-25 23:24:26,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2022-11-25 23:24:26,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2022-11-25 23:24:26,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2022-11-25 23:24:26,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2022-11-25 23:24:26,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2022-11-25 23:24:26,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2022-11-25 23:24:26,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2022-11-25 23:24:26,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2022-11-25 23:24:26,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2022-11-25 23:24:26,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2022-11-25 23:24:26,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2022-11-25 23:24:26,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2022-11-25 23:24:26,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2022-11-25 23:24:26,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 23:24:26,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:24:26,473 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:24:26,480 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 23:24:26,480 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:24:26,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:24:26 BasicIcfg [2022-11-25 23:24:26,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:24:26,659 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:24:26,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:24:26,660 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:24:26,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:22:58" (3/4) ... [2022-11-25 23:24:26,664 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 23:24:26,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:24:26,665 INFO L158 Benchmark]: Toolchain (without parser) took 91437.27ms. Allocated memory was 69.2MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 44.5MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-25 23:24:26,665 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 56.6MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:24:26,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 774.81ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 31.9MB in the end (delta: 12.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-11-25 23:24:26,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.01ms. Allocated memory is still 69.2MB. Free memory was 31.9MB in the beginning and 48.3MB in the end (delta: -16.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 23:24:26,667 INFO L158 Benchmark]: Boogie Preprocessor took 42.55ms. Allocated memory is still 69.2MB. Free memory was 48.3MB in the beginning and 45.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:24:26,668 INFO L158 Benchmark]: RCFGBuilder took 2009.56ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.6MB in the beginning and 53.6MB in the end (delta: -8.0MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2022-11-25 23:24:26,668 INFO L158 Benchmark]: TraceAbstraction took 88533.67ms. Allocated memory was 83.9MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 52.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-25 23:24:26,670 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 4.6GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:24:26,672 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.30ms. Allocated memory is still 56.6MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 774.81ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 31.9MB in the end (delta: 12.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.01ms. Allocated memory is still 69.2MB. Free memory was 31.9MB in the beginning and 48.3MB in the end (delta: -16.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.55ms. Allocated memory is still 69.2MB. Free memory was 48.3MB in the beginning and 45.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2009.56ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.6MB in the beginning and 53.6MB in the end (delta: -8.0MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * TraceAbstraction took 88533.67ms. Allocated memory was 83.9MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 52.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 4.6GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.9s, 187 PlacesBefore, 82 PlacesAfterwards, 179 TransitionsBefore, 73 TransitionsAfterwards, 6624 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 153 TotalNumberOfCompositions, 34323 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8570, independent: 7957, independent conditional: 0, independent unconditional: 7957, dependent: 561, dependent conditional: 0, dependent unconditional: 561, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3402, independent: 3306, independent conditional: 0, independent unconditional: 3306, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3402, independent: 3150, independent conditional: 0, independent unconditional: 3150, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 252, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4571, independent: 943, independent conditional: 0, independent unconditional: 943, dependent: 1432, dependent conditional: 0, dependent unconditional: 1432, unknown: 2196, unknown conditional: 0, unknown unconditional: 2196] ], Cache Queries: [ total: 8570, independent: 4651, independent conditional: 0, independent unconditional: 4651, dependent: 472, dependent conditional: 0, dependent unconditional: 472, unknown: 3447, unknown conditional: 0, unknown unconditional: 3447] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 429, Positive conditional cache size: 0, Positive unconditional cache size: 429, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=0, t1780={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1781; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780={15:0}, t1781={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=1, t1780={15:0}, t1781={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t1782; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=2, t1780={15:0}, t1781={7:0}, t1782={13:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L760] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={15:0}, t1781={7:0}, t1782={13:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=2, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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: -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: -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: -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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 234 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 88.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1127 IncrementalHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 36 mSDtfsCounter, 1127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35046occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 3149 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 654 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1604 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 could not prove your program: unable to determine feasibility of some traces [2022-11-25 23:24:26,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8da4393b-b9fc-45f6-a08e-185b94b42011/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 Result: UNKNOWN: Overapproximated counterexample