./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur --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 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:05:01,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:05:01,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:05:01,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:05:01,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:05:01,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:05:01,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:05:01,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:05:01,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:05:01,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:05:01,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:05:01,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:05:01,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:05:01,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:05:01,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:05:01,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:05:01,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:05:01,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:05:01,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:05:01,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:05:01,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:05:01,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:05:01,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:05:01,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:05:01,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:05:01,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:05:01,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:05:01,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:05:01,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:05:01,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:05:01,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:05:01,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:05:01,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:05:01,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:05:01,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:05:01,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:05:01,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:05:01,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:05:01,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:05:01,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:05:01,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:05:01,556 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:05:01,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:05:01,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:05:01,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:05:01,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:05:01,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:05:01,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:05:01,582 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:05:01,582 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:05:01,582 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:05:01,583 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:05:01,583 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:05:01,583 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:05:01,583 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:05:01,583 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:05:01,584 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:05:01,584 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:05:01,584 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:05:01,584 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:05:01,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:05:01,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:05:01,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:05:01,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:05:01,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:05:01,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:05:01,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:05:01,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:05:01,587 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:05:01,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:05:01,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:05:01,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:05:01,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:05:01,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:05:01,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:05:01,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:05:01,589 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:05:01,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:05:01,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:05:01,589 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:05:01,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:05:01,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:05:01,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:05:01,590 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_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab [2022-11-26 00:05:01,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:05:01,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:05:01,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:05:01,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:05:01,889 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:05:01,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i [2022-11-26 00:05:04,910 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:05:05,260 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:05:05,261 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i [2022-11-26 00:05:05,283 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/data/7ef0668e2/41c881a6650a4203849979a816f9cd7e/FLAG3f184ad3a [2022-11-26 00:05:05,296 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/data/7ef0668e2/41c881a6650a4203849979a816f9cd7e [2022-11-26 00:05:05,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:05:05,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:05:05,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:05:05,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:05:05,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:05:05,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:05" (1/1) ... [2022-11-26 00:05:05,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315c69da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:05, skipping insertion in model container [2022-11-26 00:05:05,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:05" (1/1) ... [2022-11-26 00:05:05,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:05:05,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:05:05,538 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_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i[994,1007] [2022-11-26 00:05:05,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:05:05,914 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:05:05,926 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_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i[994,1007] [2022-11-26 00:05:05,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:05,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:05,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:05:06,016 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:05:06,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06 WrapperNode [2022-11-26 00:05:06,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:05:06,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:05:06,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:05:06,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:05:06,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,105 INFO L138 Inliner]: procedures = 176, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2022-11-26 00:05:06,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:05:06,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:05:06,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:05:06,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:05:06,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,174 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:05:06,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:05:06,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:05:06,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:05:06,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (1/1) ... [2022-11-26 00:05:06,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:05:06,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:05:06,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:05:06,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:05:06,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:05:06,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:05:06,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-26 00:05:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:05:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:05:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:05:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-26 00:05:06,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-26 00:05:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-26 00:05:06,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-26 00:05:06,283 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-26 00:05:06,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-26 00:05:06,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:05:06,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-26 00:05:06,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:05:06,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:05:06,285 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 00:05:06,536 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:05:06,538 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:05:07,124 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:05:07,556 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:05:07,557 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:05:07,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:07 BoogieIcfgContainer [2022-11-26 00:05:07,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:05:07,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:05:07,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:05:07,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:05:07,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:05:05" (1/3) ... [2022-11-26 00:05:07,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37781dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:07, skipping insertion in model container [2022-11-26 00:05:07,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:06" (2/3) ... [2022-11-26 00:05:07,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37781dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:07, skipping insertion in model container [2022-11-26 00:05:07,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:07" (3/3) ... [2022-11-26 00:05:07,575 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2022-11-26 00:05:07,585 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 00:05:07,596 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:05:07,596 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:05:07,596 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:05:07,691 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-26 00:05:07,739 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:05:07,766 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-26 00:05:07,771 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-26 00:05:07,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 277 flow [2022-11-26 00:05:07,870 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-11-26 00:05:07,870 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-26 00:05:07,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-11-26 00:05:07,884 INFO L119 LiptonReduction]: Number of co-enabled transitions 1852 [2022-11-26 00:05:26,037 INFO L134 LiptonReduction]: Checked pairs total: 5001 [2022-11-26 00:05:26,037 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-26 00:05:26,046 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2022-11-26 00:05:26,129 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 450 states, 449 states have (on average 3.024498886414254) internal successors, (1358), 449 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:26,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:05:26,159 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;@3c2577, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:05:26,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-26 00:05:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 450 states, 449 states have (on average 3.024498886414254) internal successors, (1358), 449 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:05:26,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:26,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:26,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1495558534, now seen corresponding path program 1 times [2022-11-26 00:05:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:26,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517547379] [2022-11-26 00:05:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:26,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:26,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517547379] [2022-11-26 00:05:26,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517547379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:26,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:26,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:05:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076368756] [2022-11-26 00:05:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:26,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:05:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:26,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:05:26,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:26,996 INFO L87 Difference]: Start difference. First operand has 450 states, 449 states have (on average 3.024498886414254) internal successors, (1358), 449 states have internal predecessors, (1358), 0 states have call successors, (0), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:27,142 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2022-11-26 00:05:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:05:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:05:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:27,174 INFO L225 Difference]: With dead ends: 440 [2022-11-26 00:05:27,174 INFO L226 Difference]: Without dead ends: 440 [2022-11-26 00:05:27,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:27,180 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:27,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-11-26 00:05:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2022-11-26 00:05:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0068337129840548) internal successors, (1320), 439 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2022-11-26 00:05:27,273 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2022-11-26 00:05:27,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:27,275 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2022-11-26 00:05:27,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2022-11-26 00:05:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:05:27,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:27,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:27,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:05:27,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:27,279 INFO L85 PathProgramCache]: Analyzing trace with hash 732261136, now seen corresponding path program 1 times [2022-11-26 00:05:27,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:27,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312267803] [2022-11-26 00:05:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:27,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:27,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:27,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312267803] [2022-11-26 00:05:27,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312267803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:27,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:27,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:05:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918911250] [2022-11-26 00:05:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:27,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:05:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:27,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:05:27,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:27,676 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:27,771 INFO L93 Difference]: Finished difference Result 425 states and 1268 transitions. [2022-11-26 00:05:27,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:05:27,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:05:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:27,776 INFO L225 Difference]: With dead ends: 425 [2022-11-26 00:05:27,776 INFO L226 Difference]: Without dead ends: 425 [2022-11-26 00:05:27,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:27,779 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:27,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-26 00:05:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2022-11-26 00:05:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 2.990566037735849) internal successors, (1268), 424 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1268 transitions. [2022-11-26 00:05:27,819 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1268 transitions. Word has length 10 [2022-11-26 00:05:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:27,820 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 1268 transitions. [2022-11-26 00:05:27,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1268 transitions. [2022-11-26 00:05:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:05:27,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:27,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:27,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:05:27,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1223635386, now seen corresponding path program 1 times [2022-11-26 00:05:27,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:27,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814931599] [2022-11-26 00:05:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:29,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:29,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814931599] [2022-11-26 00:05:29,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814931599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:29,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:29,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:05:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090117934] [2022-11-26 00:05:29,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:29,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:05:29,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:29,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:05:29,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:05:29,479 INFO L87 Difference]: Start difference. First operand 425 states and 1268 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:29,595 INFO L93 Difference]: Finished difference Result 410 states and 1216 transitions. [2022-11-26 00:05:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:05:29,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 00:05:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:29,598 INFO L225 Difference]: With dead ends: 410 [2022-11-26 00:05:29,598 INFO L226 Difference]: Without dead ends: 410 [2022-11-26 00:05:29,599 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-11-26 00:05:29,600 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:29,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-26 00:05:29,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-11-26 00:05:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.9731051344743276) internal successors, (1216), 409 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1216 transitions. [2022-11-26 00:05:29,616 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1216 transitions. Word has length 11 [2022-11-26 00:05:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:29,616 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 1216 transitions. [2022-11-26 00:05:29,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1216 transitions. [2022-11-26 00:05:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:05:29,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:29,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:29,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:05:29,618 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:29,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:29,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1942320663, now seen corresponding path program 1 times [2022-11-26 00:05:29,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:29,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089213795] [2022-11-26 00:05:29,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:29,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:30,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:30,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089213795] [2022-11-26 00:05:30,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089213795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:30,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:30,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:05:30,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628455164] [2022-11-26 00:05:30,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:30,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:05:30,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:30,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:05:30,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:05:30,901 INFO L87 Difference]: Start difference. First operand 410 states and 1216 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-11-26 00:05:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:31,135 INFO L93 Difference]: Finished difference Result 431 states and 1267 transitions. [2022-11-26 00:05:31,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:05:31,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-11-26 00:05:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:31,139 INFO L225 Difference]: With dead ends: 431 [2022-11-26 00:05:31,139 INFO L226 Difference]: Without dead ends: 431 [2022-11-26 00:05:31,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:05:31,141 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:31,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:05:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-26 00:05:31,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 395. [2022-11-26 00:05:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 2.954314720812183) internal successors, (1164), 394 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1164 transitions. [2022-11-26 00:05:31,155 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1164 transitions. Word has length 12 [2022-11-26 00:05:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:31,156 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 1164 transitions. [2022-11-26 00:05:31,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-11-26 00:05:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1164 transitions. [2022-11-26 00:05:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:05:31,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:31,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:31,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:05:31,158 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash -311239573, now seen corresponding path program 1 times [2022-11-26 00:05:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:31,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048792639] [2022-11-26 00:05:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:31,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:31,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048792639] [2022-11-26 00:05:31,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048792639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:31,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:31,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:05:31,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85305892] [2022-11-26 00:05:31,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:31,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:05:31,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:31,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:05:31,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:05:31,443 INFO L87 Difference]: Start difference. First operand 395 states and 1164 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:31,580 INFO L93 Difference]: Finished difference Result 383 states and 999 transitions. [2022-11-26 00:05:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:05:31,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:05:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:31,583 INFO L225 Difference]: With dead ends: 383 [2022-11-26 00:05:31,583 INFO L226 Difference]: Without dead ends: 283 [2022-11-26 00:05:31,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:05:31,584 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:31,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-26 00:05:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-11-26 00:05:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 2.5390070921985815) internal successors, (716), 282 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 716 transitions. [2022-11-26 00:05:31,597 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 716 transitions. Word has length 13 [2022-11-26 00:05:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:31,597 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 716 transitions. [2022-11-26 00:05:31,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 716 transitions. [2022-11-26 00:05:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:05:31,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:31,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:31,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:05:31,599 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash -332986768, now seen corresponding path program 1 times [2022-11-26 00:05:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:31,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633438353] [2022-11-26 00:05:31,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:31,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:32,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:32,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633438353] [2022-11-26 00:05:32,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633438353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:32,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:32,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:05:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656091273] [2022-11-26 00:05:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:32,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:05:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:05:32,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:05:32,034 INFO L87 Difference]: Start difference. First operand 283 states and 716 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:32,202 INFO L93 Difference]: Finished difference Result 235 states and 547 transitions. [2022-11-26 00:05:32,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:05:32,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-26 00:05:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:32,204 INFO L225 Difference]: With dead ends: 235 [2022-11-26 00:05:32,205 INFO L226 Difference]: Without dead ends: 183 [2022-11-26 00:05:32,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:05:32,206 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:32,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 14 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:05:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-26 00:05:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-26 00:05:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.2857142857142856) internal successors, (416), 182 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 416 transitions. [2022-11-26 00:05:32,215 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 416 transitions. Word has length 15 [2022-11-26 00:05:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:32,216 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 416 transitions. [2022-11-26 00:05:32,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 416 transitions. [2022-11-26 00:05:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:05:32,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:32,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:32,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:05:32,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:32,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash 358736130, now seen corresponding path program 1 times [2022-11-26 00:05:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:32,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642065218] [2022-11-26 00:05:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:32,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:32,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642065218] [2022-11-26 00:05:32,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642065218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:32,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:32,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:05:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426173602] [2022-11-26 00:05:32,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:32,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:05:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:32,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:05:32,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:05:32,666 INFO L87 Difference]: Start difference. First operand 183 states and 416 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:32,822 INFO L93 Difference]: Finished difference Result 165 states and 378 transitions. [2022-11-26 00:05:32,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:05:32,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-26 00:05:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:32,824 INFO L225 Difference]: With dead ends: 165 [2022-11-26 00:05:32,824 INFO L226 Difference]: Without dead ends: 153 [2022-11-26 00:05:32,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:05:32,825 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:32,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 12 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-26 00:05:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-11-26 00:05:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.3421052631578947) internal successors, (356), 152 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 356 transitions. [2022-11-26 00:05:32,830 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 356 transitions. Word has length 17 [2022-11-26 00:05:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:32,831 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 356 transitions. [2022-11-26 00:05:32,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 356 transitions. [2022-11-26 00:05:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:05:32,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:32,832 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-11-26 00:05:32,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:05:32,833 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:32,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:32,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1694302222, now seen corresponding path program 1 times [2022-11-26 00:05:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:32,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411795366] [2022-11-26 00:05:32,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:32,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:33,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:33,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411795366] [2022-11-26 00:05:33,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411795366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:33,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:33,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:05:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482622057] [2022-11-26 00:05:33,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:33,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:05:33,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:05:33,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:33,095 INFO L87 Difference]: Start difference. First operand 153 states and 356 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:33,165 INFO L93 Difference]: Finished difference Result 200 states and 454 transitions. [2022-11-26 00:05:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:05:33,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-26 00:05:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:33,167 INFO L225 Difference]: With dead ends: 200 [2022-11-26 00:05:33,167 INFO L226 Difference]: Without dead ends: 87 [2022-11-26 00:05:33,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:33,168 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:33,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-26 00:05:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-26 00:05:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.046511627906977) internal successors, (176), 86 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2022-11-26 00:05:33,171 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 20 [2022-11-26 00:05:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:33,172 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2022-11-26 00:05:33,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2022-11-26 00:05:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:05:33,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:33,172 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-11-26 00:05:33,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:05:33,173 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash 537151638, now seen corresponding path program 2 times [2022-11-26 00:05:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:33,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916987417] [2022-11-26 00:05:33,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:33,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:35,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:35,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916987417] [2022-11-26 00:05:35,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916987417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:35,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:35,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:05:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232161172] [2022-11-26 00:05:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:35,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:05:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:05:35,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:05:35,115 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-11-26 00:05:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:35,262 INFO L93 Difference]: Finished difference Result 139 states and 270 transitions. [2022-11-26 00:05:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:05:35,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-11-26 00:05:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:35,264 INFO L225 Difference]: With dead ends: 139 [2022-11-26 00:05:35,264 INFO L226 Difference]: Without dead ends: 71 [2022-11-26 00:05:35,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:05:35,265 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:35,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-26 00:05:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2022-11-26 00:05:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 56 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 104 transitions. [2022-11-26 00:05:35,268 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 104 transitions. Word has length 20 [2022-11-26 00:05:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:35,273 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 104 transitions. [2022-11-26 00:05:35,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-11-26 00:05:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 104 transitions. [2022-11-26 00:05:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:05:35,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:35,275 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-11-26 00:05:35,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:05:35,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:35,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:35,276 INFO L85 PathProgramCache]: Analyzing trace with hash -210870890, now seen corresponding path program 3 times [2022-11-26 00:05:35,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:35,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046550645] [2022-11-26 00:05:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:35,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:36,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:36,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046550645] [2022-11-26 00:05:36,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046550645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:36,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:36,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:05:36,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098691194] [2022-11-26 00:05:36,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:05:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:05:36,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:05:36,685 INFO L87 Difference]: Start difference. First operand 57 states and 104 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11-26 00:05:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:36,942 INFO L93 Difference]: Finished difference Result 103 states and 190 transitions. [2022-11-26 00:05:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:05:36,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11-26 00:05:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:36,944 INFO L225 Difference]: With dead ends: 103 [2022-11-26 00:05:36,944 INFO L226 Difference]: Without dead ends: 65 [2022-11-26 00:05:36,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:05:36,945 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:36,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 5 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:05:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-26 00:05:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2022-11-26 00:05:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 56 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2022-11-26 00:05:36,947 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 20 [2022-11-26 00:05:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:36,948 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2022-11-26 00:05:36,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11-26 00:05:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2022-11-26 00:05:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:05:36,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:36,948 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-11-26 00:05:36,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:05:36,949 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:36,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1216973894, now seen corresponding path program 4 times [2022-11-26 00:05:36,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:36,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913095616] [2022-11-26 00:05:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:36,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:38,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:38,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913095616] [2022-11-26 00:05:38,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913095616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:38,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:38,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:05:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625240999] [2022-11-26 00:05:38,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:38,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:05:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:05:38,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:05:38,977 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11-26 00:05:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:39,245 INFO L93 Difference]: Finished difference Result 75 states and 129 transitions. [2022-11-26 00:05:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:05:39,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11-26 00:05:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:39,247 INFO L225 Difference]: With dead ends: 75 [2022-11-26 00:05:39,247 INFO L226 Difference]: Without dead ends: 47 [2022-11-26 00:05:39,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:05:39,248 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:39,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:05:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-26 00:05:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-26 00:05:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 46 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2022-11-26 00:05:39,250 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2022-11-26 00:05:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:39,251 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2022-11-26 00:05:39,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11-26 00:05:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2022-11-26 00:05:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:05:39,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:39,251 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-11-26 00:05:39,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:05:39,252 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:05:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash 529952868, now seen corresponding path program 5 times [2022-11-26 00:05:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:39,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998303564] [2022-11-26 00:05:39,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:05:39,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:05:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:05:39,553 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:05:39,553 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:05:39,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-26 00:05:39,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-26 00:05:39,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-26 00:05:39,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-26 00:05:39,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 00:05:39,560 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:39,566 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-26 00:05:39,566 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:05:39,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:05:39 BasicIcfg [2022-11-26 00:05:39,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:05:39,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:05:39,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:05:39,698 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:05:39,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:07" (3/4) ... [2022-11-26 00:05:39,700 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-26 00:05:39,837 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:05:39,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:05:39,838 INFO L158 Benchmark]: Toolchain (without parser) took 34537.95ms. Allocated memory was 148.9MB in the beginning and 505.4MB in the end (delta: 356.5MB). Free memory was 116.9MB in the beginning and 337.8MB in the end (delta: -220.9MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB. [2022-11-26 00:05:39,838 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 148.9MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:05:39,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 717.44ms. Allocated memory is still 148.9MB. Free memory was 116.9MB in the beginning and 87.0MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-26 00:05:39,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.62ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 84.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:05:39,841 INFO L158 Benchmark]: Boogie Preprocessor took 65.81ms. Allocated memory is still 148.9MB. Free memory was 84.4MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:05:39,842 INFO L158 Benchmark]: RCFGBuilder took 1377.38ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 81.8MB in the beginning and 147.5MB in the end (delta: -65.7MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2022-11-26 00:05:39,842 INFO L158 Benchmark]: TraceAbstraction took 32132.13ms. Allocated memory was 190.8MB in the beginning and 505.4MB in the end (delta: 314.6MB). Free memory was 146.4MB in the beginning and 355.6MB in the end (delta: -209.2MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. [2022-11-26 00:05:39,843 INFO L158 Benchmark]: Witness Printer took 139.78ms. Allocated memory is still 505.4MB. Free memory was 355.6MB in the beginning and 337.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-26 00:05:39,844 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.32ms. Allocated memory is still 148.9MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 717.44ms. Allocated memory is still 148.9MB. Free memory was 116.9MB in the beginning and 87.0MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.62ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 84.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.81ms. Allocated memory is still 148.9MB. Free memory was 84.4MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1377.38ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 81.8MB in the beginning and 147.5MB in the end (delta: -65.7MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 32132.13ms. Allocated memory was 190.8MB in the beginning and 505.4MB in the end (delta: 314.6MB). Free memory was 146.4MB in the beginning and 355.6MB in the end (delta: -209.2MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. * Witness Printer took 139.78ms. Allocated memory is still 505.4MB. Free memory was 355.6MB in the beginning and 337.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.3s, 139 PlacesBefore, 34 PlacesAfterwards, 131 TransitionsBefore, 25 TransitionsAfterwards, 1852 CoEnabledTransitionPairs, 8 FixpointIterations, 59 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 5001 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1890, independent: 1677, independent conditional: 0, independent unconditional: 1677, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1263, independent: 1208, independent conditional: 0, independent unconditional: 1208, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1263, independent: 1185, independent conditional: 0, independent unconditional: 1185, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 977, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 945, dependent conditional: 0, dependent unconditional: 945, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1890, independent: 469, independent conditional: 0, independent unconditional: 469, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 1263, unknown conditional: 0, unknown unconditional: 1263] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L853] 0 pthread_t t2124; [L854] FCALL, FORK 0 pthread_create(&t2124, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2124, ((void *)0), P0, ((void *)0))=-1, t2124={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t2125; [L856] FCALL, FORK 0 pthread_create(&t2125, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2125, ((void *)0), P1, ((void *)0))=0, t2124={7:0}, t2125={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t2126; [L858] FCALL, FORK 0 pthread_create(&t2126, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2126, ((void *)0), P2, ((void *)0))=1, t2124={7:0}, t2125={5:0}, t2126={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L814] 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)))) [L814] EXPR 3 \read(x) [L814] 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)))) [L814] 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)))) [L815] 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)))) [L816] 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)))) [L817] 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)))) [L818] 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)))) [L819] 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)))) [L820] 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)))) [L821] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L822] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L823] EXPR 3 \read(x) [L823] 3 __unbuffered_p2_EAX = x [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] 3 x = x$flush_delayed ? x$mem_tmp : x [L825] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L828] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] 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) [L768] EXPR 1 \read(x) [L768] 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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, 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=50, weak$$choice1=255, 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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, 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=50, weak$$choice1=255, 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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, 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=50, weak$$choice1=255, 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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 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) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] 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) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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_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$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, 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=50, weak$$choice1=255, 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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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$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, 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=50, weak$$choice1=255, 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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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_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$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, 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, t2124={7:0}, t2125={5:0}, t2126={6:0}, weak$$choice0=50, weak$$choice1=255, 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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(x) [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] EXPR 0 \read(x) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 \read(x) [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] EXPR 0 \read(x) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 31.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 226 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 29 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=0, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-26 00:05:39,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00adbd4f-b72b-48a4-a6fd-1be28fc0fdd2/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE