./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/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_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/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_b1d61b16-e523-4792-83cd-69a2ce3b00b6/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 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b --- 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 06:22:21,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:22:21,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:22:21,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:22:21,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:22:21,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:22:21,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:22:21,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:22:21,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:22:21,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:22:21,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:22:21,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:22:21,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:22:21,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:22:21,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:22:21,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:22:21,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:22:21,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:22:21,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:22:21,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:22:21,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:22:21,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:22:21,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:22:21,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:22:21,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:22:21,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:22:21,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:22:21,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:22:21,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:22:21,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:22:21,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:22:21,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:22:21,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:22:21,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:22:21,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:22:21,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:22:21,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:22:21,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:22:21,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:22:21,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:22:21,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:22:21,069 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 06:22:21,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:22:21,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:22:21,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:22:21,085 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:22:21,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:22:21,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:22:21,086 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:22:21,086 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:22:21,087 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:22:21,087 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:22:21,087 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:22:21,087 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:22:21,087 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:22:21,088 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:22:21,088 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:22:21,088 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:22:21,088 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:22:21,088 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:22:21,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:22:21,089 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:22:21,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:22:21,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:22:21,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:22:21,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:22:21,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:22:21,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:22:21,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:22:21,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:22:21,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:22:21,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:22:21,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:22:21,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:22:21,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:22:21,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:22:21,092 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:22:21,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:22:21,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:22:21,092 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:22:21,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:22:21,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:22:21,093 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:22:21,093 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_b1d61b16-e523-4792-83cd-69a2ce3b00b6/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_b1d61b16-e523-4792-83cd-69a2ce3b00b6/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 -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b [2022-12-14 06:22:21,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:22:21,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:22:21,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:22:21,273 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:22:21,273 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:22:21,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2022-12-14 06:22:23,906 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:22:24,062 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:22:24,062 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2022-12-14 06:22:24,073 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/data/e5e74cf2e/a4cec192b20d4a5fa6b3bec5e14e5b5c/FLAGc5e29538b [2022-12-14 06:22:24,087 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/data/e5e74cf2e/a4cec192b20d4a5fa6b3bec5e14e5b5c [2022-12-14 06:22:24,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:22:24,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:22:24,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:22:24,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:22:24,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:22:24,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3868f059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24, skipping insertion in model container [2022-12-14 06:22:24,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:22:24,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:22:24,289 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_b1d61b16-e523-4792-83cd-69a2ce3b00b6/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007] [2022-12-14 06:22:24,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:22:24,472 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:22:24,481 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007] [2022-12-14 06:22:24,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:22:24,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:22:24,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:22:24,573 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:22:24,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24 WrapperNode [2022-12-14 06:22:24,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:22:24,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:22:24,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:22:24,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:22:24,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,618 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-12-14 06:22:24,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:22:24,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:22:24,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:22:24,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:22:24,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,648 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:22:24,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:22:24,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:22:24,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:22:24,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (1/1) ... [2022-12-14 06:22:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:22:24,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:22:24,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:22:24,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:22:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 06:22:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 06:22:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 06:22:24,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:22:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 06:22:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 06:22:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 06:22:24,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 06:22:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 06:22:24,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 06:22:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 06:22:24,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 06:22:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 06:22:24,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 06:22:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 06:22:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 06:22:24,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:22:24,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:22:24,725 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 06:22:24,853 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:22:24,855 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:22:25,243 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:22:25,514 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:22:25,514 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 06:22:25,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:22:25 BoogieIcfgContainer [2022-12-14 06:22:25,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:22:25,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:22:25,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:22:25,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:22:25,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:22:24" (1/3) ... [2022-12-14 06:22:25,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5165d65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:22:25, skipping insertion in model container [2022-12-14 06:22:25,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:22:24" (2/3) ... [2022-12-14 06:22:25,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5165d65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:22:25, skipping insertion in model container [2022-12-14 06:22:25,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:22:25" (3/3) ... [2022-12-14 06:22:25,522 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2022-12-14 06:22:25,531 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 06:22:25,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:22:25,540 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 06:22:25,540 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 06:22:25,604 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 06:22:25,627 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 06:22:25,637 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 153 transitions, 326 flow [2022-12-14 06:22:25,639 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 153 transitions, 326 flow [2022-12-14 06:22:25,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 153 transitions, 326 flow [2022-12-14 06:22:25,680 INFO L130 PetriNetUnfolder]: 2/149 cut-off events. [2022-12-14 06:22:25,680 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 06:22:25,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-14 06:22:25,687 INFO L119 LiptonReduction]: Number of co-enabled transitions 2872 [2022-12-14 06:22:32,615 INFO L134 LiptonReduction]: Checked pairs total: 6740 [2022-12-14 06:22:32,615 INFO L136 LiptonReduction]: Total number of compositions: 136 [2022-12-14 06:22:32,620 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 32 transitions, 84 flow [2022-12-14 06:22:32,709 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2410 states, 2407 states have (on average 3.986705442459493) internal successors, (9596), 2409 states have internal predecessors, (9596), 0 states have call successors, (0), 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 06:22:32,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:22:32,727 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;@19d3fb5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:22:32,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 06:22:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 2410 states, 2407 states have (on average 3.986705442459493) internal successors, (9596), 2409 states have internal predecessors, (9596), 0 states have call successors, (0), 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 06:22:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 06:22:32,737 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:32,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 06:22:32,738 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash 936743706, now seen corresponding path program 1 times [2022-12-14 06:22:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:32,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346917881] [2022-12-14 06:22:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:33,045 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 06:22:33,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:33,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346917881] [2022-12-14 06:22:33,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346917881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:33,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:33,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 06:22:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10002635] [2022-12-14 06:22:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:33,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:22:33,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:22:33,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:22:33,084 INFO L87 Difference]: Start difference. First operand has 2410 states, 2407 states have (on average 3.986705442459493) internal successors, (9596), 2409 states have internal predecessors, (9596), 0 states have call successors, (0), 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.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:33,229 INFO L93 Difference]: Finished difference Result 1882 states and 7048 transitions. [2022-12-14 06:22:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:22:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 06:22:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:33,260 INFO L225 Difference]: With dead ends: 1882 [2022-12-14 06:22:33,260 INFO L226 Difference]: Without dead ends: 1802 [2022-12-14 06:22:33,261 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 06:22:33,264 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:33,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:22:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-12-14 06:22:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2022-12-14 06:22:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 3.7667962243198225) internal successors, (6784), 1801 states have internal predecessors, (6784), 0 states have call successors, (0), 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 06:22:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2022-12-14 06:22:33,388 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 5 [2022-12-14 06:22:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:33,388 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2022-12-14 06:22:33,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2022-12-14 06:22:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 06:22:33,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:33,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:33,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:22:33,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash 38980336, now seen corresponding path program 1 times [2022-12-14 06:22:33,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:33,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844332861] [2022-12-14 06:22:33,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:33,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:33,727 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 06:22:33,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:33,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844332861] [2022-12-14 06:22:33,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844332861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:33,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:33,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:22:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436080042] [2022-12-14 06:22:33,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:33,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:22:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:33,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:22:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:22:33,730 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 06:22:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:33,905 INFO L93 Difference]: Finished difference Result 1994 states and 7280 transitions. [2022-12-14 06:22:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:22:33,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 06:22:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:33,913 INFO L225 Difference]: With dead ends: 1994 [2022-12-14 06:22:33,913 INFO L226 Difference]: Without dead ends: 1674 [2022-12-14 06:22:33,913 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 06:22:33,914 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:33,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 5 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:22:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2022-12-14 06:22:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2022-12-14 06:22:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 3.7298266586969517) internal successors, (6240), 1673 states have internal predecessors, (6240), 0 states have call successors, (0), 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 06:22:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 6240 transitions. [2022-12-14 06:22:33,970 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 6240 transitions. Word has length 12 [2022-12-14 06:22:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:33,970 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 6240 transitions. [2022-12-14 06:22:33,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 06:22:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 6240 transitions. [2022-12-14 06:22:33,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 06:22:33,972 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:33,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:33,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 06:22:33,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1676914362, now seen corresponding path program 1 times [2022-12-14 06:22:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:33,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809685785] [2022-12-14 06:22:33,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:34,123 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 06:22:34,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:34,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809685785] [2022-12-14 06:22:34,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809685785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:34,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:34,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:22:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431617507] [2022-12-14 06:22:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:34,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:22:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:22:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:22:34,125 INFO L87 Difference]: Start difference. First operand 1674 states and 6240 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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 06:22:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:34,274 INFO L93 Difference]: Finished difference Result 1802 states and 6528 transitions. [2022-12-14 06:22:34,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:22:34,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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 06:22:34,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:34,285 INFO L225 Difference]: With dead ends: 1802 [2022-12-14 06:22:34,286 INFO L226 Difference]: Without dead ends: 1546 [2022-12-14 06:22:34,286 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 06:22:34,287 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:34,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 5 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:22:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-12-14 06:22:34,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2022-12-14 06:22:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 3.6867313915857607) internal successors, (5696), 1545 states have internal predecessors, (5696), 0 states have call successors, (0), 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 06:22:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 5696 transitions. [2022-12-14 06:22:34,329 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 5696 transitions. Word has length 13 [2022-12-14 06:22:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:34,329 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 5696 transitions. [2022-12-14 06:22:34,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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 06:22:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 5696 transitions. [2022-12-14 06:22:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 06:22:34,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:34,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:34,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 06:22:34,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:34,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1515671548, now seen corresponding path program 1 times [2022-12-14 06:22:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:34,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111574498] [2022-12-14 06:22:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:34,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:34,561 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 06:22:34,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:34,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111574498] [2022-12-14 06:22:34,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111574498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:34,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:34,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:22:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808012031] [2022-12-14 06:22:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:22:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:22:34,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:22:34,563 INFO L87 Difference]: Start difference. First operand 1546 states and 5696 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:34,733 INFO L93 Difference]: Finished difference Result 2182 states and 7965 transitions. [2022-12-14 06:22:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:22:34,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 06:22:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:34,740 INFO L225 Difference]: With dead ends: 2182 [2022-12-14 06:22:34,741 INFO L226 Difference]: Without dead ends: 1120 [2022-12-14 06:22:34,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 06:22:34,741 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:34,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 2 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:22:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2022-12-14 06:22:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2022-12-14 06:22:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 3.604110813226095) internal successors, (4033), 1119 states have internal predecessors, (4033), 0 states have call successors, (0), 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 06:22:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 4033 transitions. [2022-12-14 06:22:34,772 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 4033 transitions. Word has length 14 [2022-12-14 06:22:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:34,773 INFO L495 AbstractCegarLoop]: Abstraction has 1120 states and 4033 transitions. [2022-12-14 06:22:34,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 4033 transitions. [2022-12-14 06:22:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 06:22:34,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:34,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:34,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 06:22:34,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:34,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2001126892, now seen corresponding path program 1 times [2022-12-14 06:22:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:34,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674328368] [2022-12-14 06:22:34,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:34,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:35,619 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 06:22:35,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:35,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674328368] [2022-12-14 06:22:35,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674328368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:35,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:35,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 06:22:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209956165] [2022-12-14 06:22:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:35,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:22:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:35,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:22:35,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:22:35,621 INFO L87 Difference]: Start difference. First operand 1120 states and 4033 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 06:22:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:35,966 INFO L93 Difference]: Finished difference Result 1390 states and 4937 transitions. [2022-12-14 06:22:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:22:35,967 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 06:22:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:35,972 INFO L225 Difference]: With dead ends: 1390 [2022-12-14 06:22:35,972 INFO L226 Difference]: Without dead ends: 1212 [2022-12-14 06:22:35,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-14 06:22:35,973 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 66 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:35,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 12 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:22:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2022-12-14 06:22:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1100. [2022-12-14 06:22:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1099 states have (on average 3.5505004549590535) internal successors, (3902), 1099 states have internal predecessors, (3902), 0 states have call successors, (0), 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 06:22:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 3902 transitions. [2022-12-14 06:22:35,997 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 3902 transitions. Word has length 15 [2022-12-14 06:22:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:35,997 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 3902 transitions. [2022-12-14 06:22:35,997 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 06:22:35,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 3902 transitions. [2022-12-14 06:22:35,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 06:22:35,999 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:35,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:35,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 06:22:35,999 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:36,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash -921659839, now seen corresponding path program 1 times [2022-12-14 06:22:36,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:36,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128936871] [2022-12-14 06:22:36,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:36,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:36,135 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 06:22:36,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:36,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128936871] [2022-12-14 06:22:36,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128936871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:36,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:36,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:22:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465360364] [2022-12-14 06:22:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:36,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:22:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:22:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:22:36,138 INFO L87 Difference]: Start difference. First operand 1100 states and 3902 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:36,209 INFO L93 Difference]: Finished difference Result 863 states and 2765 transitions. [2022-12-14 06:22:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:22:36,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 06:22:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:36,213 INFO L225 Difference]: With dead ends: 863 [2022-12-14 06:22:36,213 INFO L226 Difference]: Without dead ends: 863 [2022-12-14 06:22:36,213 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 06:22:36,214 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 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 06:22:36,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:22:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-12-14 06:22:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2022-12-14 06:22:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 3.2076566125290022) internal successors, (2765), 862 states have internal predecessors, (2765), 0 states have call successors, (0), 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 06:22:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 2765 transitions. [2022-12-14 06:22:36,231 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 2765 transitions. Word has length 16 [2022-12-14 06:22:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:36,232 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 2765 transitions. [2022-12-14 06:22:36,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 2765 transitions. [2022-12-14 06:22:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 06:22:36,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:36,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:36,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 06:22:36,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:36,233 INFO L85 PathProgramCache]: Analyzing trace with hash -174638632, now seen corresponding path program 1 times [2022-12-14 06:22:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:36,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383364947] [2022-12-14 06:22:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:36,414 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 06:22:36,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:36,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383364947] [2022-12-14 06:22:36,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383364947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:36,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:36,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:22:36,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047433782] [2022-12-14 06:22:36,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:36,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:22:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:36,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:22:36,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:22:36,415 INFO L87 Difference]: Start difference. First operand 863 states and 2765 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:36,503 INFO L93 Difference]: Finished difference Result 535 states and 1490 transitions. [2022-12-14 06:22:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:22:36,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 06:22:36,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:36,504 INFO L225 Difference]: With dead ends: 535 [2022-12-14 06:22:36,505 INFO L226 Difference]: Without dead ends: 535 [2022-12-14 06:22:36,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:22:36,505 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:36,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:22:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-12-14 06:22:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2022-12-14 06:22:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 2.790262172284644) internal successors, (1490), 534 states have internal predecessors, (1490), 0 states have call successors, (0), 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 06:22:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1490 transitions. [2022-12-14 06:22:36,514 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1490 transitions. Word has length 18 [2022-12-14 06:22:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:36,514 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 1490 transitions. [2022-12-14 06:22:36,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1490 transitions. [2022-12-14 06:22:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 06:22:36,515 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:36,515 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 06:22:36,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 06:22:36,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash -357119189, now seen corresponding path program 1 times [2022-12-14 06:22:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:36,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471873923] [2022-12-14 06:22:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:37,345 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 06:22:37,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:37,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471873923] [2022-12-14 06:22:37,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471873923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:37,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:37,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 06:22:37,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443266419] [2022-12-14 06:22:37,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:37,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 06:22:37,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:37,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 06:22:37,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:22:37,347 INFO L87 Difference]: Start difference. First operand 535 states and 1490 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 06:22:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:37,790 INFO L93 Difference]: Finished difference Result 1090 states and 2992 transitions. [2022-12-14 06:22:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 06:22:37,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 06:22:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:37,794 INFO L225 Difference]: With dead ends: 1090 [2022-12-14 06:22:37,795 INFO L226 Difference]: Without dead ends: 862 [2022-12-14 06:22:37,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-12-14 06:22:37,795 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 85 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:37,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 24 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:22:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-12-14 06:22:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 678. [2022-12-14 06:22:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 2.774002954209749) internal successors, (1878), 677 states have internal predecessors, (1878), 0 states have call successors, (0), 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 06:22:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1878 transitions. [2022-12-14 06:22:37,819 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1878 transitions. Word has length 20 [2022-12-14 06:22:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:37,819 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1878 transitions. [2022-12-14 06:22:37,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 06:22:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1878 transitions. [2022-12-14 06:22:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 06:22:37,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:37,820 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 06:22:37,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 06:22:37,820 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash 219157915, now seen corresponding path program 1 times [2022-12-14 06:22:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:37,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289449408] [2022-12-14 06:22:37,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:37,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:37,979 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 06:22:37,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:37,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289449408] [2022-12-14 06:22:37,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289449408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:37,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:37,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:22:37,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213437154] [2022-12-14 06:22:37,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:37,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:22:37,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:37,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:22:37,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:22:37,981 INFO L87 Difference]: Start difference. First operand 678 states and 1878 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 06:22:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:38,093 INFO L93 Difference]: Finished difference Result 481 states and 1294 transitions. [2022-12-14 06:22:38,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:22:38,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 06:22:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:38,095 INFO L225 Difference]: With dead ends: 481 [2022-12-14 06:22:38,095 INFO L226 Difference]: Without dead ends: 481 [2022-12-14 06:22:38,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:22:38,096 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:38,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:22:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-12-14 06:22:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2022-12-14 06:22:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 2.6958333333333333) internal successors, (1294), 480 states have internal predecessors, (1294), 0 states have call successors, (0), 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 06:22:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1294 transitions. [2022-12-14 06:22:38,103 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1294 transitions. Word has length 20 [2022-12-14 06:22:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:38,103 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 1294 transitions. [2022-12-14 06:22:38,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 06:22:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1294 transitions. [2022-12-14 06:22:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 06:22:38,104 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:38,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:38,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 06:22:38,104 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:38,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash 886563944, now seen corresponding path program 1 times [2022-12-14 06:22:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:38,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129528002] [2022-12-14 06:22:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:39,282 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 06:22:39,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:39,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129528002] [2022-12-14 06:22:39,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129528002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:39,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:39,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 06:22:39,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320486228] [2022-12-14 06:22:39,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:39,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 06:22:39,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:39,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 06:22:39,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:22:39,285 INFO L87 Difference]: Start difference. First operand 481 states and 1294 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:39,678 INFO L93 Difference]: Finished difference Result 702 states and 1840 transitions. [2022-12-14 06:22:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:22:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 06:22:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:39,681 INFO L225 Difference]: With dead ends: 702 [2022-12-14 06:22:39,681 INFO L226 Difference]: Without dead ends: 618 [2022-12-14 06:22:39,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:22:39,681 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 55 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:39,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 29 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:22:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-12-14 06:22:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 469. [2022-12-14 06:22:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 2.6837606837606836) internal successors, (1256), 468 states have internal predecessors, (1256), 0 states have call successors, (0), 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 06:22:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1256 transitions. [2022-12-14 06:22:39,692 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1256 transitions. Word has length 22 [2022-12-14 06:22:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:39,693 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 1256 transitions. [2022-12-14 06:22:39,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1256 transitions. [2022-12-14 06:22:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 06:22:39,694 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:39,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:39,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 06:22:39,694 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1680153198, now seen corresponding path program 2 times [2022-12-14 06:22:39,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:39,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684932085] [2022-12-14 06:22:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:39,888 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 06:22:39,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:39,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684932085] [2022-12-14 06:22:39,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684932085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:39,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:39,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:22:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430680735] [2022-12-14 06:22:39,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:39,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:22:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:39,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:22:39,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:22:39,889 INFO L87 Difference]: Start difference. First operand 469 states and 1256 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:39,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:39,995 INFO L93 Difference]: Finished difference Result 424 states and 1166 transitions. [2022-12-14 06:22:39,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:22:39,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 06:22:39,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:39,998 INFO L225 Difference]: With dead ends: 424 [2022-12-14 06:22:39,998 INFO L226 Difference]: Without dead ends: 388 [2022-12-14 06:22:39,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:22:39,999 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:39,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:22:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-12-14 06:22:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2022-12-14 06:22:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 2.7700258397932815) internal successors, (1072), 387 states have internal predecessors, (1072), 0 states have call successors, (0), 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 06:22:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1072 transitions. [2022-12-14 06:22:40,004 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1072 transitions. Word has length 22 [2022-12-14 06:22:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:40,004 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 1072 transitions. [2022-12-14 06:22:40,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1072 transitions. [2022-12-14 06:22:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 06:22:40,005 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:40,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:40,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 06:22:40,005 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:40,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:40,006 INFO L85 PathProgramCache]: Analyzing trace with hash 853659630, now seen corresponding path program 1 times [2022-12-14 06:22:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:40,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338574106] [2022-12-14 06:22:40,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:41,190 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 06:22:41,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:41,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338574106] [2022-12-14 06:22:41,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338574106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:22:41,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:22:41,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 06:22:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277932196] [2022-12-14 06:22:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:22:41,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 06:22:41,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 06:22:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-14 06:22:41,192 INFO L87 Difference]: Start difference. First operand 388 states and 1072 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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 06:22:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:41,646 INFO L93 Difference]: Finished difference Result 583 states and 1555 transitions. [2022-12-14 06:22:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:22:41,646 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 06:22:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:41,647 INFO L225 Difference]: With dead ends: 583 [2022-12-14 06:22:41,647 INFO L226 Difference]: Without dead ends: 462 [2022-12-14 06:22:41,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:22:41,648 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:41,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 21 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:22:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-12-14 06:22:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 366. [2022-12-14 06:22:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.734246575342466) internal successors, (998), 365 states have internal predecessors, (998), 0 states have call successors, (0), 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 06:22:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 998 transitions. [2022-12-14 06:22:41,654 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 998 transitions. Word has length 25 [2022-12-14 06:22:41,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:41,654 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 998 transitions. [2022-12-14 06:22:41,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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 06:22:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 998 transitions. [2022-12-14 06:22:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 06:22:41,654 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:41,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:41,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 06:22:41,655 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 06:22:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2021609006, now seen corresponding path program 2 times [2022-12-14 06:22:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:41,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131289088] [2022-12-14 06:22:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:22:41,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 06:22:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:22:41,865 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 06:22:41,865 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 06:22:41,865 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-14 06:22:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-14 06:22:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-14 06:22:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-14 06:22:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-14 06:22:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-14 06:22:41,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-14 06:22:41,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 06:22:41,869 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:41,873 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 06:22:41,873 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 06:22:41,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 06:22:41 BasicIcfg [2022-12-14 06:22:41,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 06:22:41,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 06:22:41,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 06:22:41,952 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 06:22:41,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:22:25" (3/4) ... [2022-12-14 06:22:41,953 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 06:22:42,023 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 06:22:42,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 06:22:42,024 INFO L158 Benchmark]: Toolchain (without parser) took 17933.04ms. Allocated memory was 125.8MB in the beginning and 318.8MB in the end (delta: 192.9MB). Free memory was 82.4MB in the beginning and 245.8MB in the end (delta: -163.4MB). Peak memory consumption was 199.8MB. Max. memory is 16.1GB. [2022-12-14 06:22:42,024 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:22:42,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.32ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 82.4MB in the beginning and 143.8MB in the end (delta: -61.4MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-12-14 06:22:42,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.66ms. Allocated memory is still 182.5MB. Free memory was 143.8MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:22:42,024 INFO L158 Benchmark]: Boogie Preprocessor took 35.58ms. Allocated memory is still 182.5MB. Free memory was 141.6MB in the beginning and 138.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:22:42,025 INFO L158 Benchmark]: RCFGBuilder took 860.58ms. Allocated memory is still 182.5MB. Free memory was 138.5MB in the beginning and 122.3MB in the end (delta: 16.2MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2022-12-14 06:22:42,025 INFO L158 Benchmark]: TraceAbstraction took 16433.61ms. Allocated memory was 182.5MB in the beginning and 318.8MB in the end (delta: 136.3MB). Free memory was 122.3MB in the beginning and 85.3MB in the end (delta: 37.0MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. [2022-12-14 06:22:42,025 INFO L158 Benchmark]: Witness Printer took 71.84ms. Allocated memory is still 318.8MB. Free memory was 85.3MB in the beginning and 245.8MB in the end (delta: -160.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 06:22:42,026 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.12ms. Allocated memory is still 125.8MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.32ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 82.4MB in the beginning and 143.8MB in the end (delta: -61.4MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.66ms. Allocated memory is still 182.5MB. Free memory was 143.8MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.58ms. Allocated memory is still 182.5MB. Free memory was 141.6MB in the beginning and 138.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 860.58ms. Allocated memory is still 182.5MB. Free memory was 138.5MB in the beginning and 122.3MB in the end (delta: 16.2MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16433.61ms. Allocated memory was 182.5MB in the beginning and 318.8MB in the end (delta: 136.3MB). Free memory was 122.3MB in the beginning and 85.3MB in the end (delta: 37.0MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. * Witness Printer took 71.84ms. Allocated memory is still 318.8MB. Free memory was 85.3MB in the beginning and 245.8MB in the end (delta: -160.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 164 PlacesBefore, 44 PlacesAfterwards, 153 TransitionsBefore, 32 TransitionsAfterwards, 2872 CoEnabledTransitionPairs, 7 FixpointIterations, 65 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 6740 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3290, independent: 3085, independent conditional: 0, independent unconditional: 3085, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1902, independent: 1841, independent conditional: 0, independent unconditional: 1841, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1902, independent: 1812, independent conditional: 0, independent unconditional: 1812, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 601, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 573, dependent conditional: 0, dependent unconditional: 573, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3290, independent: 1244, independent conditional: 0, independent unconditional: 1244, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 1902, unknown conditional: 0, unknown unconditional: 1902] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2421, ((void *)0), P0, ((void *)0))=-3, t2421={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2422, ((void *)0), P1, ((void *)0))=-2, t2421={7:0}, t2422={8: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2423, ((void *)0), P2, ((void *)0))=-1, t2421={7:0}, t2422={8:0}, t2423={9: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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 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_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 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_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=255, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L842] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=255, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L845] 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) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] 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) [L845] 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) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 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 [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=255, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L890] 0 pthread_t t2424; [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2424, ((void *)0), P3, ((void *)0))=0, t2421={7:0}, t2422={8:0}, t2423={9:0}, t2424={5:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=255, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L859] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=6, weak$$choice1=1, weak$$choice2=255, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L768] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=6, weak$$choice1=1, weak$$choice2=255, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 1 \read(x) [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] EXPR 1 \read(x) [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=7, 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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 1 return 0; [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=7, 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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L871] 4 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] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=7, 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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 3 return 0; [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] 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) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] 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) [L897] 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) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 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 [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421={7:0}, t2422={8:0}, t2423={9:0}, t2424={5:0}, weak$$choice0=7, 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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=7, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] - UnprovableResult [Line: 19]: 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: 887]: 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: 885]: 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: 889]: 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: 891]: 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 9 procedures, 186 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 497 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1963 IncrementalHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 24 mSDtfsCounter, 1963 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2410occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 541 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 2064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 06:22:42,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1d61b16-e523-4792-83cd-69a2ce3b00b6/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