./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/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_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/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_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/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 eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:34:36,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:34:36,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:34:36,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:34:36,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:34:36,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:34:36,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:34:36,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:34:36,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:34:36,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:34:36,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:34:36,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:34:36,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:34:36,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:34:36,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:34:36,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:34:36,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:34:36,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:34:36,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:34:36,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:34:36,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:34:36,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:34:36,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:34:36,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:34:36,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:34:36,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:34:36,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:34:36,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:34:36,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:34:36,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:34:36,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:34:36,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:34:36,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:34:36,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:34:36,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:34:36,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:34:36,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:34:36,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:34:36,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:34:36,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:34:36,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:34:36,585 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 22:34:36,630 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:34:36,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:34:36,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:34:36,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:34:36,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:34:36,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:34:36,633 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:34:36,633 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:34:36,634 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:34:36,634 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:34:36,635 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:34:36,636 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:34:36,636 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:34:36,636 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:34:36,637 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:34:36,637 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:34:36,637 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:34:36,638 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:34:36,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:34:36,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:34:36,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:34:36,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:34:36,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:34:36,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:34:36,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:34:36,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:34:36,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:34:36,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:34:36,642 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:34:36,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:34:36,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:34:36,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:34:36,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:34:36,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:34:36,644 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:34:36,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:34:36,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:34:36,646 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:34:36,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:34:36,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:34:36,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:34:36,647 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_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/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_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2022-11-25 22:34:37,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:34:37,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:34:37,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:34:37,034 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:34:37,034 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:34:37,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-25 22:34:40,262 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:34:40,603 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:34:40,604 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-25 22:34:40,625 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/data/256fafb6b/78c666d6ae0d42e1ac250d7bbbee9294/FLAG46fae6c09 [2022-11-25 22:34:40,640 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/data/256fafb6b/78c666d6ae0d42e1ac250d7bbbee9294 [2022-11-25 22:34:40,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:34:40,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:34:40,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:34:40,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:34:40,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:34:40,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:34:40" (1/1) ... [2022-11-25 22:34:40,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7eda9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:40, skipping insertion in model container [2022-11-25 22:34:40,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:34:40" (1/1) ... [2022-11-25 22:34:40,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:34:40,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:34:40,966 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_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-25 22:34:41,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:34:41,328 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:34:41,349 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_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-25 22:34:41,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 22:34:41,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 22:34:41,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:34:41,516 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:34:41,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41 WrapperNode [2022-11-25 22:34:41,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:34:41,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:34:41,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:34:41,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:34:41,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,623 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-11-25 22:34:41,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:34:41,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:34:41,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:34:41,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:34:41,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,681 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:34:41,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:34:41,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:34:41,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:34:41,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (1/1) ... [2022-11-25 22:34:41,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:34:41,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:34:41,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:34:41,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:34:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 22:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 22:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 22:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:34:41,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:34:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:34:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 22:34:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 22:34:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 22:34:41,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 22:34:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:34:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 22:34:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:34:41,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:34:41,782 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 22:34:42,000 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:34:42,002 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:34:42,527 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:34:42,878 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:34:42,879 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 22:34:42,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:34:42 BoogieIcfgContainer [2022-11-25 22:34:42,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:34:42,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:34:42,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:34:42,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:34:42,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:34:40" (1/3) ... [2022-11-25 22:34:42,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406c104d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:34:42, skipping insertion in model container [2022-11-25 22:34:42,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:34:41" (2/3) ... [2022-11-25 22:34:42,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406c104d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:34:42, skipping insertion in model container [2022-11-25 22:34:42,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:34:42" (3/3) ... [2022-11-25 22:34:42,893 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2022-11-25 22:34:42,904 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 22:34:42,916 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:34:42,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 22:34:42,917 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 22:34:43,087 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 22:34:43,142 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 22:34:43,178 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 112 transitions, 234 flow [2022-11-25 22:34:43,183 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 112 transitions, 234 flow [2022-11-25 22:34:43,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 112 transitions, 234 flow [2022-11-25 22:34:43,272 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-25 22:34:43,272 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 22:34:43,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-11-25 22:34:43,281 INFO L119 LiptonReduction]: Number of co-enabled transitions 1154 [2022-11-25 22:34:54,990 INFO L134 LiptonReduction]: Checked pairs total: 3273 [2022-11-25 22:34:54,990 INFO L136 LiptonReduction]: Total number of compositions: 106 [2022-11-25 22:34:54,998 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 50 flow [2022-11-25 22:34:55,028 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 149 states, 146 states have (on average 2.4794520547945207) internal successors, (362), 148 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:55,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:34:55,056 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;@1dc6aea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:34:55,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 22:34:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 146 states have (on average 2.4794520547945207) internal successors, (362), 148 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:34:55,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:55,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:34:55,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:34:55,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 22829954, now seen corresponding path program 1 times [2022-11-25 22:34:55,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:55,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351332284] [2022-11-25 22:34:55,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:55,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:55,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:34:55,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351332284] [2022-11-25 22:34:55,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351332284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:34:55,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:34:55,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:34:55,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897731852] [2022-11-25 22:34:55,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:34:55,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:34:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:34:55,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:34:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:34:55,621 INFO L87 Difference]: Start difference. First operand has 149 states, 146 states have (on average 2.4794520547945207) internal successors, (362), 148 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:55,745 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2022-11-25 22:34:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:34:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 22:34:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:55,766 INFO L225 Difference]: With dead ends: 122 [2022-11-25 22:34:55,766 INFO L226 Difference]: Without dead ends: 112 [2022-11-25 22:34:55,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:34:55,775 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:55,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:34:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-25 22:34:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-25 22:34:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.2972972972972974) internal successors, (255), 111 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2022-11-25 22:34:55,840 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 4 [2022-11-25 22:34:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:55,840 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2022-11-25 22:34:55,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2022-11-25 22:34:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:34:55,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:55,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:34:55,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:34:55,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:34:55,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1575142615, now seen corresponding path program 1 times [2022-11-25 22:34:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:55,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142170689] [2022-11-25 22:34:55,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:56,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:34:56,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142170689] [2022-11-25 22:34:56,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142170689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:34:56,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:34:56,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:34:56,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013184692] [2022-11-25 22:34:56,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:34:56,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:34:56,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:34:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:34:56,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:34:56,246 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:56,331 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2022-11-25 22:34:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:34:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-25 22:34:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:56,333 INFO L225 Difference]: With dead ends: 107 [2022-11-25 22:34:56,335 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 22:34:56,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:34:56,338 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:56,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:34:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 22:34:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-25 22:34:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.2735849056603774) internal successors, (241), 106 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2022-11-25 22:34:56,355 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 7 [2022-11-25 22:34:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:56,356 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2022-11-25 22:34:56,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2022-11-25 22:34:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:34:56,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:56,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:34:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:34:56,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:34:56,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash 66920415, now seen corresponding path program 1 times [2022-11-25 22:34:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:56,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327531433] [2022-11-25 22:34:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:56,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:56,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:34:56,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327531433] [2022-11-25 22:34:56,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327531433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:34:56,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:34:56,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:34:56,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613736460] [2022-11-25 22:34:56,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:34:56,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:34:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:34:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:34:56,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:34:56,845 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:56,902 INFO L93 Difference]: Finished difference Result 103 states and 230 transitions. [2022-11-25 22:34:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:34:56,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 22:34:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:56,923 INFO L225 Difference]: With dead ends: 103 [2022-11-25 22:34:56,923 INFO L226 Difference]: Without dead ends: 103 [2022-11-25 22:34:56,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:34:56,927 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:56,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:34:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-25 22:34:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-25 22:34:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.2549019607843137) internal successors, (230), 102 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 230 transitions. [2022-11-25 22:34:56,943 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 230 transitions. Word has length 8 [2022-11-25 22:34:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:56,944 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 230 transitions. [2022-11-25 22:34:56,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 230 transitions. [2022-11-25 22:34:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:34:56,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:56,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:34:56,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 22:34:56,945 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:34:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2073242908, now seen corresponding path program 1 times [2022-11-25 22:34:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:56,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001132681] [2022-11-25 22:34:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:57,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:34:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001132681] [2022-11-25 22:34:57,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001132681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:34:57,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:34:57,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:34:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041441755] [2022-11-25 22:34:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:34:57,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:34:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:34:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:34:57,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:34:57,240 INFO L87 Difference]: Start difference. First operand 103 states and 230 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-25 22:34:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:57,318 INFO L93 Difference]: Finished difference Result 135 states and 294 transitions. [2022-11-25 22:34:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:34:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-25 22:34:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:57,319 INFO L225 Difference]: With dead ends: 135 [2022-11-25 22:34:57,319 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 22:34:57,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:34:57,321 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:57,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:34:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 22:34:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-25 22:34:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.106060606060606) internal successors, (139), 66 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 139 transitions. [2022-11-25 22:34:57,326 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 139 transitions. Word has length 9 [2022-11-25 22:34:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:57,326 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 139 transitions. [2022-11-25 22:34:57,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-25 22:34:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 139 transitions. [2022-11-25 22:34:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 22:34:57,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:57,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:34:57,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 22:34:57,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:34:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1236308855, now seen corresponding path program 1 times [2022-11-25 22:34:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:57,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59964407] [2022-11-25 22:34:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:57,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:58,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:34:58,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59964407] [2022-11-25 22:34:58,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59964407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:34:58,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:34:58,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:34:58,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185067087] [2022-11-25 22:34:58,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:34:58,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:34:58,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:34:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:34:58,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:34:58,724 INFO L87 Difference]: Start difference. First operand 67 states and 139 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:58,923 INFO L93 Difference]: Finished difference Result 67 states and 138 transitions. [2022-11-25 22:34:58,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:34:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 22:34:58,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:58,925 INFO L225 Difference]: With dead ends: 67 [2022-11-25 22:34:58,925 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 22:34:58,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:34:58,926 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:58,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:34:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 22:34:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-25 22:34:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 138 transitions. [2022-11-25 22:34:58,936 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 138 transitions. Word has length 10 [2022-11-25 22:34:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:58,936 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 138 transitions. [2022-11-25 22:34:58,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 138 transitions. [2022-11-25 22:34:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:34:58,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:58,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:34:58,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:34:58,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:34:58,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash -331880875, now seen corresponding path program 1 times [2022-11-25 22:34:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:58,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572536957] [2022-11-25 22:34:58,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:35:00,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:00,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572536957] [2022-11-25 22:35:00,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572536957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:00,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:00,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:35:00,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429603215] [2022-11-25 22:35:00,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:00,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:35:00,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:35:00,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:35:00,316 INFO L87 Difference]: Start difference. First operand 67 states and 138 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:00,505 INFO L93 Difference]: Finished difference Result 66 states and 135 transitions. [2022-11-25 22:35:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:35:00,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:35:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:00,506 INFO L225 Difference]: With dead ends: 66 [2022-11-25 22:35:00,506 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 22:35:00,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:35:00,509 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:00,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:35:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 22:35:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-11-25 22:35:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.078125) internal successors, (133), 64 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 133 transitions. [2022-11-25 22:35:00,515 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 133 transitions. Word has length 11 [2022-11-25 22:35:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:00,515 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 133 transitions. [2022-11-25 22:35:00,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 133 transitions. [2022-11-25 22:35:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:35:00,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:00,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:00,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 22:35:00,518 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:35:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:00,518 INFO L85 PathProgramCache]: Analyzing trace with hash -331642547, now seen corresponding path program 1 times [2022-11-25 22:35:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:00,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170247449] [2022-11-25 22:35:00,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:00,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:35:02,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:02,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170247449] [2022-11-25 22:35:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170247449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:02,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:02,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:35:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630233701] [2022-11-25 22:35:02,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:02,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:35:02,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:02,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:35:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:35:02,193 INFO L87 Difference]: Start difference. First operand 65 states and 133 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:02,411 INFO L93 Difference]: Finished difference Result 79 states and 159 transitions. [2022-11-25 22:35:02,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:35:02,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:35:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:02,413 INFO L225 Difference]: With dead ends: 79 [2022-11-25 22:35:02,413 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 22:35:02,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:35:02,414 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:02,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:35:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 22:35:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-11-25 22:35:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 73 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 147 transitions. [2022-11-25 22:35:02,420 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 147 transitions. Word has length 11 [2022-11-25 22:35:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:02,420 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 147 transitions. [2022-11-25 22:35:02,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 147 transitions. [2022-11-25 22:35:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:35:02,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:02,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:02,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 22:35:02,426 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:35:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:02,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1893237709, now seen corresponding path program 2 times [2022-11-25 22:35:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:02,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705179125] [2022-11-25 22:35:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:35:04,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:04,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705179125] [2022-11-25 22:35:04,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705179125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:04,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:04,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:35:04,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830160092] [2022-11-25 22:35:04,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:04,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:35:04,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:04,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:35:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:35:04,833 INFO L87 Difference]: Start difference. First operand 74 states and 147 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:04,995 INFO L93 Difference]: Finished difference Result 79 states and 157 transitions. [2022-11-25 22:35:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:35:04,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:35:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:04,997 INFO L225 Difference]: With dead ends: 79 [2022-11-25 22:35:04,997 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 22:35:04,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:35:04,998 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:04,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:35:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 22:35:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2022-11-25 22:35:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 64 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 131 transitions. [2022-11-25 22:35:05,009 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 131 transitions. Word has length 11 [2022-11-25 22:35:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:05,009 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 131 transitions. [2022-11-25 22:35:05,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 131 transitions. [2022-11-25 22:35:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 22:35:05,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:05,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:05,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 22:35:05,012 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:35:05,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:05,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1701092458, now seen corresponding path program 1 times [2022-11-25 22:35:05,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:05,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146083284] [2022-11-25 22:35:05,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:05,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:35:05,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:05,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146083284] [2022-11-25 22:35:05,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146083284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:05,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:05,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:35:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855072028] [2022-11-25 22:35:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:05,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:35:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:35:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:35:05,300 INFO L87 Difference]: Start difference. First operand 65 states and 131 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:05,420 INFO L93 Difference]: Finished difference Result 58 states and 98 transitions. [2022-11-25 22:35:05,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:35:05,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 22:35:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:05,421 INFO L225 Difference]: With dead ends: 58 [2022-11-25 22:35:05,421 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 22:35:05,422 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-25 22:35:05,422 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:05,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:35:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 22:35:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-25 22:35:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.6) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-11-25 22:35:05,426 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 12 [2022-11-25 22:35:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:05,426 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-11-25 22:35:05,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-11-25 22:35:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:35:05,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:05,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:05,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 22:35:05,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:35:05,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1194535709, now seen corresponding path program 1 times [2022-11-25 22:35:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:05,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807101241] [2022-11-25 22:35:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:05,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:35:05,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:35:05,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807101241] [2022-11-25 22:35:05,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807101241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:05,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:05,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:35:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505405872] [2022-11-25 22:35:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:05,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:35:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:35:05,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:35:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:35:05,706 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:05,810 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-11-25 22:35:05,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:35:05,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 22:35:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:05,811 INFO L225 Difference]: With dead ends: 31 [2022-11-25 22:35:05,811 INFO L226 Difference]: Without dead ends: 24 [2022-11-25 22:35:05,811 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-25 22:35:05,812 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:35:05,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:35:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-25 22:35:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-25 22:35:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-11-25 22:35:05,814 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2022-11-25 22:35:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:05,814 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-11-25 22:35:05,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:35:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-11-25 22:35:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 22:35:05,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:05,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:05,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 22:35:05,816 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 22:35:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1271006109, now seen corresponding path program 1 times [2022-11-25 22:35:05,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:05,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648385243] [2022-11-25 22:35:05,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:05,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:35:05,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 22:35:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:35:06,010 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 22:35:06,010 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 22:35:06,011 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-25 22:35:06,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-25 22:35:06,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-25 22:35:06,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-25 22:35:06,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-25 22:35:06,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 22:35:06,016 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:06,022 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 22:35:06,022 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 22:35:06,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 10:35:06 BasicIcfg [2022-11-25 22:35:06,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 22:35:06,083 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 22:35:06,083 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 22:35:06,083 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 22:35:06,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:34:42" (3/4) ... [2022-11-25 22:35:06,086 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 22:35:06,159 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 22:35:06,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 22:35:06,160 INFO L158 Benchmark]: Toolchain (without parser) took 25516.26ms. Allocated memory was 174.1MB in the beginning and 385.9MB in the end (delta: 211.8MB). Free memory was 138.5MB in the beginning and 168.4MB in the end (delta: -29.9MB). Peak memory consumption was 180.8MB. Max. memory is 16.1GB. [2022-11-25 22:35:06,161 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:35:06,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 872.21ms. Allocated memory is still 174.1MB. Free memory was 138.5MB in the beginning and 125.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 22:35:06,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.71ms. Allocated memory is still 174.1MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:35:06,161 INFO L158 Benchmark]: Boogie Preprocessor took 63.56ms. Allocated memory is still 174.1MB. Free memory was 123.4MB in the beginning and 121.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:35:06,162 INFO L158 Benchmark]: RCFGBuilder took 1194.02ms. Allocated memory is still 174.1MB. Free memory was 121.2MB in the beginning and 52.1MB in the end (delta: 69.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2022-11-25 22:35:06,162 INFO L158 Benchmark]: TraceAbstraction took 23197.66ms. Allocated memory was 174.1MB in the beginning and 385.9MB in the end (delta: 211.8MB). Free memory was 51.2MB in the beginning and 179.9MB in the end (delta: -128.7MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2022-11-25 22:35:06,162 INFO L158 Benchmark]: Witness Printer took 76.49ms. Allocated memory is still 385.9MB. Free memory was 179.9MB in the beginning and 168.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 22:35:06,164 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.15ms. Allocated memory is still 130.0MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 872.21ms. Allocated memory is still 174.1MB. Free memory was 138.5MB in the beginning and 125.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.71ms. Allocated memory is still 174.1MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.56ms. Allocated memory is still 174.1MB. Free memory was 123.4MB in the beginning and 121.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1194.02ms. Allocated memory is still 174.1MB. Free memory was 121.2MB in the beginning and 52.1MB in the end (delta: 69.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23197.66ms. Allocated memory was 174.1MB in the beginning and 385.9MB in the end (delta: 211.8MB). Free memory was 51.2MB in the beginning and 179.9MB in the end (delta: -128.7MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * Witness Printer took 76.49ms. Allocated memory is still 385.9MB. Free memory was 179.9MB in the beginning and 168.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8s, 117 PlacesBefore, 26 PlacesAfterwards, 112 TransitionsBefore, 20 TransitionsAfterwards, 1154 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 3273 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1529, independent: 1367, independent conditional: 0, independent unconditional: 1367, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 869, independent: 825, independent conditional: 0, independent unconditional: 825, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 869, independent: 811, independent conditional: 0, independent unconditional: 811, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 898, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 869, dependent conditional: 0, dependent unconditional: 869, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1529, independent: 542, independent conditional: 0, independent unconditional: 542, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 869, unknown conditional: 0, unknown unconditional: 869] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1923, ((void *)0), P0, ((void *)0))=-1, t1923={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1924, ((void *)0), P1, ((void *)0))=0, t1923={7:0}, t1924={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L803] 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) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] 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) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] 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) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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 5 procedures, 130 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 22.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 450 IncrementalHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 11 mSDtfsCounter, 450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 1239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 22:35:06,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e9c8e5-2158-4f0c-980c-ea4ada18aa70/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