./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be536b3b382c4e63adbabc11deb06983f35dbd290b78e0d42f1a068990873986 --- 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-2329fc7 [2022-12-14 16:00:12,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 16:00:12,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 16:00:12,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 16:00:12,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 16:00:12,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 16:00:12,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 16:00:12,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 16:00:12,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 16:00:12,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 16:00:12,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 16:00:12,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 16:00:12,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 16:00:12,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 16:00:12,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 16:00:12,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 16:00:12,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 16:00:12,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 16:00:12,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 16:00:12,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 16:00:12,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 16:00:12,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 16:00:12,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 16:00:12,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 16:00:12,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 16:00:12,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 16:00:12,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 16:00:12,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 16:00:12,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 16:00:12,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 16:00:12,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 16:00:12,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 16:00:12,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 16:00:12,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 16:00:12,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 16:00:12,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 16:00:12,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 16:00:12,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 16:00:12,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 16:00:12,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 16:00:12,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 16:00:12,260 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 16:00:12,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 16:00:12,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 16:00:12,291 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 16:00:12,291 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 16:00:12,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 16:00:12,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 16:00:12,291 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 16:00:12,292 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 16:00:12,292 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 16:00:12,292 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 16:00:12,292 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 16:00:12,292 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 16:00:12,292 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 16:00:12,292 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 16:00:12,293 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 16:00:12,293 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 16:00:12,293 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 16:00:12,293 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 16:00:12,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 16:00:12,294 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 16:00:12,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 16:00:12,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 16:00:12,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 16:00:12,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 16:00:12,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 16:00:12,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 16:00:12,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 16:00:12,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 16:00:12,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 16:00:12,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 16:00:12,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 16:00:12,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 16:00:12,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 16:00:12,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 16:00:12,296 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 16:00:12,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 16:00:12,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 16:00:12,296 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 16:00:12,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 16:00:12,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 16:00:12,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 16:00:12,297 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_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/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_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh 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 ! call(reach_error())) ) 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 -> be536b3b382c4e63adbabc11deb06983f35dbd290b78e0d42f1a068990873986 [2022-12-14 16:00:12,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 16:00:12,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 16:00:12,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 16:00:12,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 16:00:12,480 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 16:00:12,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2022-12-14 16:00:15,066 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 16:00:15,219 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 16:00:15,219 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2022-12-14 16:00:15,228 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/data/05603e33c/710fe89f71db48bb81b720a7402ab1d6/FLAG9fcd42747 [2022-12-14 16:00:15,239 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/data/05603e33c/710fe89f71db48bb81b720a7402ab1d6 [2022-12-14 16:00:15,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 16:00:15,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 16:00:15,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 16:00:15,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 16:00:15,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 16:00:15,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a64301a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15, skipping insertion in model container [2022-12-14 16:00:15,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 16:00:15,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 16:00:15,388 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_aa47b764-5518-45db-b7a0-95bca9fd7f67/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i[951,964] [2022-12-14 16:00:15,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 16:00:15,523 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 16:00:15,532 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_aa47b764-5518-45db-b7a0-95bca9fd7f67/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i[951,964] [2022-12-14 16:00:15,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:00:15,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:00:15,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 16:00:15,593 INFO L208 MainTranslator]: Completed translation [2022-12-14 16:00:15,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15 WrapperNode [2022-12-14 16:00:15,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 16:00:15,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 16:00:15,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 16:00:15,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 16:00:15,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,630 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-12-14 16:00:15,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 16:00:15,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 16:00:15,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 16:00:15,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 16:00:15,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,652 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 16:00:15,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 16:00:15,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 16:00:15,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 16:00:15,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (1/1) ... [2022-12-14 16:00:15,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 16:00:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:00:15,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 16:00:15,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 16:00:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 16:00:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 16:00:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 16:00:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 16:00:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 16:00:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 16:00:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 16:00:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 16:00:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 16:00:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 16:00:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 16:00:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 16:00:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 16:00:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 16:00:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 16:00:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 16:00:15,714 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 16:00:15,838 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 16:00:15,840 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 16:00:16,197 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 16:00:16,443 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 16:00:16,443 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 16:00:16,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:00:16 BoogieIcfgContainer [2022-12-14 16:00:16,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 16:00:16,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 16:00:16,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 16:00:16,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 16:00:16,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:00:15" (1/3) ... [2022-12-14 16:00:16,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3538dc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:00:16, skipping insertion in model container [2022-12-14 16:00:16,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:00:15" (2/3) ... [2022-12-14 16:00:16,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3538dc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:00:16, skipping insertion in model container [2022-12-14 16:00:16,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:00:16" (3/3) ... [2022-12-14 16:00:16,454 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2022-12-14 16:00:16,463 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 16:00:16,473 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 16:00:16,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 16:00:16,473 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 16:00:16,535 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 16:00:16,566 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 16:00:16,579 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 132 transitions, 279 flow [2022-12-14 16:00:16,582 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 132 transitions, 279 flow [2022-12-14 16:00:16,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 279 flow [2022-12-14 16:00:16,636 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-14 16:00:16,636 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 16:00:16,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-14 16:00:16,644 INFO L119 LiptonReduction]: Number of co-enabled transitions 2000 [2022-12-14 16:00:23,721 INFO L134 LiptonReduction]: Checked pairs total: 5272 [2022-12-14 16:00:23,721 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-12-14 16:00:23,727 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2022-12-14 16:00:23,782 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 614 states, 611 states have (on average 3.1734860883797054) internal successors, (1939), 613 states have internal predecessors, (1939), 0 states have call successors, (0), 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-12-14 16:00:23,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 16:00:23,802 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@26c2b47f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 16:00:23,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-14 16:00:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 614 states, 611 states have (on average 3.1734860883797054) internal successors, (1939), 613 states have internal predecessors, (1939), 0 states have call successors, (0), 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-12-14 16:00:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 16:00:23,808 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:23,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 16:00:23,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash 25926252, now seen corresponding path program 1 times [2022-12-14 16:00:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:23,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573995814] [2022-12-14 16:00:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:24,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:24,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573995814] [2022-12-14 16:00:24,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573995814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:24,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:24,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 16:00:24,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900721594] [2022-12-14 16:00:24,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:24,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 16:00:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:24,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 16:00:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 16:00:24,148 INFO L87 Difference]: Start difference. First operand has 614 states, 611 states have (on average 3.1734860883797054) internal successors, (1939), 613 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 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-12-14 16:00:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:24,242 INFO L93 Difference]: Finished difference Result 502 states and 1512 transitions. [2022-12-14 16:00:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 16:00:24,245 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-12-14 16:00:24,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:24,254 INFO L225 Difference]: With dead ends: 502 [2022-12-14 16:00:24,254 INFO L226 Difference]: Without dead ends: 462 [2022-12-14 16:00:24,255 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-12-14 16:00:24,257 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:00:24,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:00:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-12-14 16:00:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2022-12-14 16:00:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 3.015184381778742) internal successors, (1390), 461 states have internal predecessors, (1390), 0 states have call successors, (0), 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-12-14 16:00:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1390 transitions. [2022-12-14 16:00:24,302 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1390 transitions. Word has length 4 [2022-12-14 16:00:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:24,302 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 1390 transitions. [2022-12-14 16:00:24,302 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-12-14 16:00:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1390 transitions. [2022-12-14 16:00:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 16:00:24,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:24,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:00:24,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 16:00:24,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:24,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1071982394, now seen corresponding path program 1 times [2022-12-14 16:00:24,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:24,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793283819] [2022-12-14 16:00:24,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:24,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:24,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:24,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793283819] [2022-12-14 16:00:24,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793283819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:24,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:24,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 16:00:24,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463187448] [2022-12-14 16:00:24,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:24,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 16:00:24,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:24,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 16:00:24,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 16:00:24,458 INFO L87 Difference]: Start difference. First operand 462 states and 1390 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:00:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:24,525 INFO L93 Difference]: Finished difference Result 442 states and 1319 transitions. [2022-12-14 16:00:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 16:00:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 16:00:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:24,528 INFO L225 Difference]: With dead ends: 442 [2022-12-14 16:00:24,528 INFO L226 Difference]: Without dead ends: 442 [2022-12-14 16:00:24,529 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-12-14 16:00:24,529 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 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-12-14 16:00:24,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:00:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-12-14 16:00:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2022-12-14 16:00:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 2.9909297052154193) internal successors, (1319), 441 states have internal predecessors, (1319), 0 states have call successors, (0), 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-12-14 16:00:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1319 transitions. [2022-12-14 16:00:24,546 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1319 transitions. Word has length 9 [2022-12-14 16:00:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:24,547 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 1319 transitions. [2022-12-14 16:00:24,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:00:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1319 transitions. [2022-12-14 16:00:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 16:00:24,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:24,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:00:24,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 16:00:24,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1128285429, now seen corresponding path program 1 times [2022-12-14 16:00:24,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:24,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532936829] [2022-12-14 16:00:24,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:24,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:24,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532936829] [2022-12-14 16:00:24,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532936829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:24,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:24,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 16:00:24,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581081319] [2022-12-14 16:00:24,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:24,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 16:00:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 16:00:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 16:00:24,664 INFO L87 Difference]: Start difference. First operand 442 states and 1319 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-12-14 16:00:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:24,758 INFO L93 Difference]: Finished difference Result 674 states and 1977 transitions. [2022-12-14 16:00:24,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 16:00:24,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-12-14 16:00:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:24,763 INFO L225 Difference]: With dead ends: 674 [2022-12-14 16:00:24,764 INFO L226 Difference]: Without dead ends: 386 [2022-12-14 16:00:24,764 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-12-14 16:00:24,765 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:00:24,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:00:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-12-14 16:00:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-12-14 16:00:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.9532467532467535) internal successors, (1137), 385 states have internal predecessors, (1137), 0 states have call successors, (0), 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-12-14 16:00:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1137 transitions. [2022-12-14 16:00:24,781 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1137 transitions. Word has length 10 [2022-12-14 16:00:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:24,781 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 1137 transitions. [2022-12-14 16:00:24,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-12-14 16:00:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1137 transitions. [2022-12-14 16:00:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 16:00:24,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:24,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:00:24,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 16:00:24,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:24,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash -673444065, now seen corresponding path program 1 times [2022-12-14 16:00:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:24,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917884104] [2022-12-14 16:00:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:24,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:24,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917884104] [2022-12-14 16:00:24,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917884104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:24,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:24,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 16:00:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096187621] [2022-12-14 16:00:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:24,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 16:00:24,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:24,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 16:00:24,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 16:00:24,935 INFO L87 Difference]: Start difference. First operand 386 states and 1137 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-12-14 16:00:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:24,998 INFO L93 Difference]: Finished difference Result 374 states and 1096 transitions. [2022-12-14 16:00:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 16:00:24,999 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-12-14 16:00:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:25,001 INFO L225 Difference]: With dead ends: 374 [2022-12-14 16:00:25,001 INFO L226 Difference]: Without dead ends: 374 [2022-12-14 16:00:25,001 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-12-14 16:00:25,002 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:00:25,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:00:25,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-12-14 16:00:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-12-14 16:00:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 2.9383378016085793) internal successors, (1096), 373 states have internal predecessors, (1096), 0 states have call successors, (0), 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-12-14 16:00:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1096 transitions. [2022-12-14 16:00:25,016 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1096 transitions. Word has length 11 [2022-12-14 16:00:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:25,017 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 1096 transitions. [2022-12-14 16:00:25,017 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-12-14 16:00:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1096 transitions. [2022-12-14 16:00:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 16:00:25,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:25,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:00:25,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 16:00:25,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1869058813, now seen corresponding path program 1 times [2022-12-14 16:00:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:25,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907747030] [2022-12-14 16:00:25,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:25,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:25,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:25,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907747030] [2022-12-14 16:00:25,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907747030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:25,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:25,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 16:00:25,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075394260] [2022-12-14 16:00:25,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:25,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 16:00:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:25,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 16:00:25,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 16:00:25,947 INFO L87 Difference]: Start difference. First operand 374 states and 1096 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:00:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:26,140 INFO L93 Difference]: Finished difference Result 409 states and 1198 transitions. [2022-12-14 16:00:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 16:00:26,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 16:00:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:26,142 INFO L225 Difference]: With dead ends: 409 [2022-12-14 16:00:26,142 INFO L226 Difference]: Without dead ends: 409 [2022-12-14 16:00:26,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 16:00:26,142 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 16:00:26,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 16:00:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-12-14 16:00:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 407. [2022-12-14 16:00:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 2.938423645320197) internal successors, (1193), 406 states have internal predecessors, (1193), 0 states have call successors, (0), 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-12-14 16:00:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1193 transitions. [2022-12-14 16:00:26,151 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1193 transitions. Word has length 12 [2022-12-14 16:00:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:26,152 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 1193 transitions. [2022-12-14 16:00:26,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:00:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1193 transitions. [2022-12-14 16:00:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 16:00:26,153 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:26,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:00:26,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 16:00:26,153 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1360216027, now seen corresponding path program 1 times [2022-12-14 16:00:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:26,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668814715] [2022-12-14 16:00:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:26,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:26,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668814715] [2022-12-14 16:00:26,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668814715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:26,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:26,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 16:00:26,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669215782] [2022-12-14 16:00:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:26,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 16:00:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 16:00:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 16:00:26,296 INFO L87 Difference]: Start difference. First operand 407 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-12-14 16:00:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:26,401 INFO L93 Difference]: Finished difference Result 398 states and 1031 transitions. [2022-12-14 16:00:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 16:00:26,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-12-14 16:00:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:26,403 INFO L225 Difference]: With dead ends: 398 [2022-12-14 16:00:26,403 INFO L226 Difference]: Without dead ends: 291 [2022-12-14 16:00:26,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 16:00:26,404 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:00:26,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 5 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:00:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-12-14 16:00:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2022-12-14 16:00:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.520979020979021) internal successors, (721), 286 states have internal predecessors, (721), 0 states have call successors, (0), 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-12-14 16:00:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 721 transitions. [2022-12-14 16:00:26,414 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 721 transitions. Word has length 13 [2022-12-14 16:00:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:26,414 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 721 transitions. [2022-12-14 16:00:26,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-12-14 16:00:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 721 transitions. [2022-12-14 16:00:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 16:00:26,416 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:26,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:00:26,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 16:00:26,416 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 307089579, now seen corresponding path program 1 times [2022-12-14 16:00:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:26,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351141499] [2022-12-14 16:00:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:27,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:27,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351141499] [2022-12-14 16:00:27,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351141499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:27,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:27,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 16:00:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393104997] [2022-12-14 16:00:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:27,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 16:00:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:27,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 16:00:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 16:00:27,374 INFO L87 Difference]: Start difference. First operand 287 states and 721 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-12-14 16:00:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:27,575 INFO L93 Difference]: Finished difference Result 299 states and 755 transitions. [2022-12-14 16:00:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 16:00:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-12-14 16:00:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:27,578 INFO L225 Difference]: With dead ends: 299 [2022-12-14 16:00:27,578 INFO L226 Difference]: Without dead ends: 299 [2022-12-14 16:00:27,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-14 16:00:27,580 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 16:00:27,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 10 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 16:00:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-12-14 16:00:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 291. [2022-12-14 16:00:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.527586206896552) internal successors, (733), 290 states have internal predecessors, (733), 0 states have call successors, (0), 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-12-14 16:00:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 733 transitions. [2022-12-14 16:00:27,586 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 733 transitions. Word has length 15 [2022-12-14 16:00:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:27,586 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 733 transitions. [2022-12-14 16:00:27,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-12-14 16:00:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 733 transitions. [2022-12-14 16:00:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 16:00:27,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:27,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:00:27,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 16:00:27,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash 295292343, now seen corresponding path program 1 times [2022-12-14 16:00:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:27,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921467244] [2022-12-14 16:00:27,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:27,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:27,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:27,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921467244] [2022-12-14 16:00:27,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921467244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:27,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:27,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 16:00:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224291248] [2022-12-14 16:00:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:27,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 16:00:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 16:00:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 16:00:27,724 INFO L87 Difference]: Start difference. First operand 291 states and 733 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-12-14 16:00:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:27,858 INFO L93 Difference]: Finished difference Result 240 states and 553 transitions. [2022-12-14 16:00:27,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 16:00:27,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-12-14 16:00:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:27,860 INFO L225 Difference]: With dead ends: 240 [2022-12-14 16:00:27,860 INFO L226 Difference]: Without dead ends: 183 [2022-12-14 16:00:27,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 16:00:27,861 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:00:27,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 7 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:00:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-14 16:00:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2022-12-14 16:00:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.2142857142857144) internal successors, (372), 168 states have internal predecessors, (372), 0 states have call successors, (0), 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-12-14 16:00:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 372 transitions. [2022-12-14 16:00:27,866 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 372 transitions. Word has length 15 [2022-12-14 16:00:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:27,866 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 372 transitions. [2022-12-14 16:00:27,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-12-14 16:00:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 372 transitions. [2022-12-14 16:00:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 16:00:27,873 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:27,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:00:27,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 16:00:27,874 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:27,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:27,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1242110051, now seen corresponding path program 1 times [2022-12-14 16:00:27,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:27,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692773664] [2022-12-14 16:00:27,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:27,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:28,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:28,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692773664] [2022-12-14 16:00:28,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692773664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:28,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:28,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 16:00:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920674139] [2022-12-14 16:00:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:28,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 16:00:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 16:00:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 16:00:28,043 INFO L87 Difference]: Start difference. First operand 169 states and 372 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-12-14 16:00:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:28,173 INFO L93 Difference]: Finished difference Result 150 states and 332 transitions. [2022-12-14 16:00:28,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 16:00:28,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-12-14 16:00:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:28,174 INFO L225 Difference]: With dead ends: 150 [2022-12-14 16:00:28,175 INFO L226 Difference]: Without dead ends: 137 [2022-12-14 16:00:28,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 16:00:28,175 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:00:28,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 7 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:00:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-12-14 16:00:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2022-12-14 16:00:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.272727272727273) internal successors, (300), 132 states have internal predecessors, (300), 0 states have call successors, (0), 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-12-14 16:00:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 300 transitions. [2022-12-14 16:00:28,180 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 300 transitions. Word has length 17 [2022-12-14 16:00:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:28,180 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 300 transitions. [2022-12-14 16:00:28,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-12-14 16:00:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 300 transitions. [2022-12-14 16:00:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 16:00:28,181 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:28,181 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] [2022-12-14 16:00:28,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 16:00:28,181 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2030196029, now seen corresponding path program 1 times [2022-12-14 16:00:28,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:28,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225808919] [2022-12-14 16:00:28,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:00:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:00:28,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:00:28,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225808919] [2022-12-14 16:00:28,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225808919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:00:28,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:00:28,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 16:00:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187399183] [2022-12-14 16:00:28,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:00:28,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 16:00:28,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:00:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 16:00:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 16:00:28,350 INFO L87 Difference]: Start difference. First operand 133 states and 300 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-12-14 16:00:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:00:28,407 INFO L93 Difference]: Finished difference Result 180 states and 398 transitions. [2022-12-14 16:00:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 16:00:28,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-12-14 16:00:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:00:28,408 INFO L225 Difference]: With dead ends: 180 [2022-12-14 16:00:28,408 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 16:00:28,408 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-12-14 16:00:28,408 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:00:28,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:00:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 16:00:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-12-14 16:00:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.196078431372549) internal successors, (224), 102 states have internal predecessors, (224), 0 states have call successors, (0), 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-12-14 16:00:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 224 transitions. [2022-12-14 16:00:28,411 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 224 transitions. Word has length 20 [2022-12-14 16:00:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:00:28,411 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 224 transitions. [2022-12-14 16:00:28,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-12-14 16:00:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 224 transitions. [2022-12-14 16:00:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 16:00:28,412 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:00:28,412 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] [2022-12-14 16:00:28,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 16:00:28,412 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 16:00:28,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:00:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1254697587, now seen corresponding path program 2 times [2022-12-14 16:00:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:00:28,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549618518] [2022-12-14 16:00:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:00:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:00:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 16:00:28,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 16:00:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 16:00:28,524 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 16:00:28,524 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 16:00:28,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-14 16:00:28,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-14 16:00:28,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-14 16:00:28,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-14 16:00:28,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-14 16:00:28,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-14 16:00:28,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 16:00:28,528 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:00:28,532 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 16:00:28,532 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 16:00:28,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:00:28 BasicIcfg [2022-12-14 16:00:28,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 16:00:28,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 16:00:28,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 16:00:28,577 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 16:00:28,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:00:16" (3/4) ... [2022-12-14 16:00:28,579 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 16:00:28,638 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 16:00:28,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 16:00:28,638 INFO L158 Benchmark]: Toolchain (without parser) took 13396.79ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 111.8MB in the beginning and 176.6MB in the end (delta: -64.8MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. [2022-12-14 16:00:28,639 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 16:00:28,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.68ms. Allocated memory is still 155.2MB. Free memory was 111.2MB in the beginning and 84.5MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-14 16:00:28,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.15ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 16:00:28,639 INFO L158 Benchmark]: Boogie Preprocessor took 25.51ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 79.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 16:00:28,639 INFO L158 Benchmark]: RCFGBuilder took 788.21ms. Allocated memory is still 155.2MB. Free memory was 79.2MB in the beginning and 80.1MB in the end (delta: -879.5kB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-12-14 16:00:28,639 INFO L158 Benchmark]: TraceAbstraction took 12128.67ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 79.4MB in the beginning and 60.0MB in the end (delta: 19.4MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2022-12-14 16:00:28,640 INFO L158 Benchmark]: Witness Printer took 61.26ms. Allocated memory is still 226.5MB. Free memory was 60.0MB in the beginning and 176.6MB in the end (delta: -116.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-12-14 16:00:28,641 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.68ms. Allocated memory is still 155.2MB. Free memory was 111.2MB in the beginning and 84.5MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.15ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.51ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 79.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 788.21ms. Allocated memory is still 155.2MB. Free memory was 79.2MB in the beginning and 80.1MB in the end (delta: -879.5kB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12128.67ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 79.4MB in the beginning and 60.0MB in the end (delta: 19.4MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. * Witness Printer took 61.26ms. Allocated memory is still 226.5MB. Free memory was 60.0MB in the beginning and 176.6MB in the end (delta: -116.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 140 PlacesBefore, 35 PlacesAfterwards, 132 TransitionsBefore, 26 TransitionsAfterwards, 2000 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 5272 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2383, independent: 2183, independent conditional: 0, independent unconditional: 2183, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1357, independent: 1291, independent conditional: 0, independent unconditional: 1291, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1357, independent: 1268, independent conditional: 0, independent unconditional: 1268, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 592, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 555, dependent conditional: 0, dependent unconditional: 555, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2383, independent: 892, independent conditional: 0, independent unconditional: 892, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 1357, unknown conditional: 0, unknown unconditional: 1357] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a 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; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1988; [L849] FCALL, FORK 0 pthread_create(&t1988, ((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, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1988, ((void *)0), P0, ((void *)0))=-2, t1988={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] [L850] 0 pthread_t t1989; [L851] FCALL, FORK 0 pthread_create(&t1989, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1989, ((void *)0), P1, ((void *)0))=-1, t1988={7:0}, t1989={5: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] [L852] 0 pthread_t t1990; [L787] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 2 x$flush_delayed = weak$$choice2 [L790] EXPR 2 \read(x) [L790] 2 x$mem_tmp = x [L791] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L792] 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)))) [L792] EXPR 2 \read(x) [L792] 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)))) [L792] 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)))) [L793] 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)))) [L794] 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)))) [L795] 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)))) [L796] 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)))) [L797] 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)))) [L798] 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)))) [L799] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L800] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L801] EXPR 2 \read(x) [L801] 2 __unbuffered_p1_EAX = x [L802] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L802] EXPR 2 \read(x) [L802] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L802] 2 x = x$flush_delayed ? x$mem_tmp : x [L803] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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] [L853] FCALL, FORK 0 pthread_create(&t1990, ((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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1990, ((void *)0), P2, ((void *)0))=0, t1988={7:0}, t1989={5:0}, t1990={6:0}, weak$$choice0=0, 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] [L806] 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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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] [L823] 3 y = 2 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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] [L826] 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) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] 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) [L826] 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) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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 [__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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L809] 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) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] EXPR 2 \read(x) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] 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) [L809] 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) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 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 [\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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L758] 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, 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=0, 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] [L761] 1 x$w_buff1 = x$w_buff0 [L762] 1 x$w_buff0 = 1 [L763] 1 x$w_buff1_used = x$w_buff0_used [L764] 1 x$w_buff0_used = (_Bool)1 [L765] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L765] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 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, 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=0, 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] [L773] 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) [L773] 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) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 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 [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 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, 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=0, 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] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] 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) [L859] 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) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 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 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1988={7:0}, t1989={5:0}, t1990={6:0}, weak$$choice0=0, 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] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L870] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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 call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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, 158 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 14 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=614occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 16:00:28,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa47b764-5518-45db-b7a0-95bca9fd7f67/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE