./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe020_power.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 11:36:15,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:36:15,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:36:15,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:36:15,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:36:15,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:36:15,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:36:15,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:36:15,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:36:15,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:36:15,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:36:15,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:36:15,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:36:15,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:36:15,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:36:15,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:36:15,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:36:15,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:36:15,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:36:15,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:36:15,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:36:15,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:36:15,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:36:15,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:36:15,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:36:15,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:36:15,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:36:15,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:36:15,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:36:15,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:36:15,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:36:15,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:36:15,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:36:15,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:36:15,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:36:15,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:36:15,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:36:15,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:36:15,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:36:15,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:36:15,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:36:15,665 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 11:36:15,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:36:15,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:36:15,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:36:15,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:36:15,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:36:15,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:36:15,688 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:36:15,688 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:36:15,688 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:36:15,689 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:36:15,689 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:36:15,689 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:36:15,689 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:36:15,689 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:36:15,689 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:36:15,690 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:36:15,690 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:36:15,690 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:36:15,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:36:15,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:36:15,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:36:15,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:36:15,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:36:15,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:36:15,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:36:15,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:36:15,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:36:15,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:36:15,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:36:15,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:36:15,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:36:15,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:36:15,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:36:15,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:36:15,693 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:36:15,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:36:15,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:36:15,693 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:36:15,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:36:15,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:36:15,694 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:36:15,694 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_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 [2022-12-14 11:36:15,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:36:15,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:36:15,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:36:15,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:36:15,895 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:36:15,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-12-14 11:36:18,501 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:36:18,658 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:36:18,658 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-12-14 11:36:18,668 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/data/ec720dc37/c269ad2989fc48ea8983d8bd6cdfb1b6/FLAGe8d74de29 [2022-12-14 11:36:18,679 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/data/ec720dc37/c269ad2989fc48ea8983d8bd6cdfb1b6 [2022-12-14 11:36:18,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:36:18,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:36:18,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:36:18,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:36:18,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:36:18,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:36:18" (1/1) ... [2022-12-14 11:36:18,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4216268f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:18, skipping insertion in model container [2022-12-14 11:36:18,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:36:18" (1/1) ... [2022-12-14 11:36:18,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:36:18,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:36:18,835 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_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-12-14 11:36:18,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:18,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:18,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:36:18,991 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:36:19,000 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_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-12-14 11:36:19,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:36:19,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:36:19,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:36:19,063 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:36:19,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19 WrapperNode [2022-12-14 11:36:19,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:36:19,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:36:19,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:36:19,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:36:19,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,098 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-12-14 11:36:19,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:36:19,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:36:19,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:36:19,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:36:19,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,118 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:36:19,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:36:19,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:36:19,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:36:19,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (1/1) ... [2022-12-14 11:36:19,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:36:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:36:19,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:36:19,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:36:19,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 11:36:19,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 11:36:19,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 11:36:19,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:36:19,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:36:19,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:36:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 11:36:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 11:36:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 11:36:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 11:36:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 11:36:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 11:36:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:36:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 11:36:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:36:19,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:36:19,191 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 11:36:19,294 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:36:19,296 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:36:19,644 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:36:19,826 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:36:19,826 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 11:36:19,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:36:19 BoogieIcfgContainer [2022-12-14 11:36:19,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:36:19,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:36:19,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:36:19,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:36:19,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:36:18" (1/3) ... [2022-12-14 11:36:19,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241730dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:36:19, skipping insertion in model container [2022-12-14 11:36:19,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:36:19" (2/3) ... [2022-12-14 11:36:19,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241730dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:36:19, skipping insertion in model container [2022-12-14 11:36:19,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:36:19" (3/3) ... [2022-12-14 11:36:19,834 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2022-12-14 11:36:19,840 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 11:36:19,848 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:36:19,848 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 11:36:19,848 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 11:36:19,898 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 11:36:19,920 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 11:36:19,930 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 131 transitions, 277 flow [2022-12-14 11:36:19,932 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 131 transitions, 277 flow [2022-12-14 11:36:19,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 277 flow [2022-12-14 11:36:19,969 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-14 11:36:19,969 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 11:36:19,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-14 11:36:19,975 INFO L119 LiptonReduction]: Number of co-enabled transitions 1852 [2022-12-14 11:36:27,435 INFO L134 LiptonReduction]: Checked pairs total: 4837 [2022-12-14 11:36:27,436 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-12-14 11:36:27,441 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2022-12-14 11:36:27,477 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 490 states, 487 states have (on average 3.1211498973305956) internal successors, (1520), 489 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:27,490 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:36:27,494 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;@53734b20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:36:27,494 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-14 11:36:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 490 states, 487 states have (on average 3.1211498973305956) internal successors, (1520), 489 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:36:27,500 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:27,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:36:27,501 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash 834276924, now seen corresponding path program 1 times [2022-12-14 11:36:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175501132] [2022-12-14 11:36:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:27,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:27,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175501132] [2022-12-14 11:36:27,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175501132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:27,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:27,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:36:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287239] [2022-12-14 11:36:27,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:27,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:36:27,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:27,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:36:27,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:36:27,801 INFO L87 Difference]: Start difference. First operand has 490 states, 487 states have (on average 3.1211498973305956) internal successors, (1520), 489 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:27,905 INFO L93 Difference]: Finished difference Result 382 states and 1123 transitions. [2022-12-14 11:36:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:36:27,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 11:36:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:27,916 INFO L225 Difference]: With dead ends: 382 [2022-12-14 11:36:27,916 INFO L226 Difference]: Without dead ends: 362 [2022-12-14 11:36:27,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:36:27,919 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:27,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:36:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-12-14 11:36:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2022-12-14 11:36:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.9695290858725762) internal successors, (1072), 361 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1072 transitions. [2022-12-14 11:36:27,962 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1072 transitions. Word has length 5 [2022-12-14 11:36:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:27,962 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 1072 transitions. [2022-12-14 11:36:27,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1072 transitions. [2022-12-14 11:36:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 11:36:27,963 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:27,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:27,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:36:27,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:27,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1848092036, now seen corresponding path program 1 times [2022-12-14 11:36:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:27,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14382394] [2022-12-14 11:36:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:28,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:28,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14382394] [2022-12-14 11:36:28,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14382394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:28,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:28,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:36:28,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804644795] [2022-12-14 11:36:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:28,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:36:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:28,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:36:28,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:36:28,108 INFO L87 Difference]: Start difference. First operand 362 states and 1072 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:28,176 INFO L93 Difference]: Finished difference Result 354 states and 1042 transitions. [2022-12-14 11:36:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:36:28,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 11:36:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:28,179 INFO L225 Difference]: With dead ends: 354 [2022-12-14 11:36:28,179 INFO L226 Difference]: Without dead ends: 354 [2022-12-14 11:36:28,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:36:28,180 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:28,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:36:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-12-14 11:36:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2022-12-14 11:36:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.951841359773371) internal successors, (1042), 353 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1042 transitions. [2022-12-14 11:36:28,194 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1042 transitions. Word has length 9 [2022-12-14 11:36:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:28,195 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 1042 transitions. [2022-12-14 11:36:28,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1042 transitions. [2022-12-14 11:36:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 11:36:28,196 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:28,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:28,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:36:28,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1456279602, now seen corresponding path program 1 times [2022-12-14 11:36:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:28,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178938614] [2022-12-14 11:36:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:28,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:28,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178938614] [2022-12-14 11:36:28,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178938614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:28,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:28,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:36:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420851931] [2022-12-14 11:36:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:28,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:36:28,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:28,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:36:28,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:36:28,366 INFO L87 Difference]: Start difference. First operand 354 states and 1042 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:28,425 INFO L93 Difference]: Finished difference Result 342 states and 1001 transitions. [2022-12-14 11:36:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:36:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 11:36:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:28,427 INFO L225 Difference]: With dead ends: 342 [2022-12-14 11:36:28,427 INFO L226 Difference]: Without dead ends: 342 [2022-12-14 11:36:28,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:36:28,428 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:28,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:36:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-12-14 11:36:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-12-14 11:36:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.935483870967742) internal successors, (1001), 341 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1001 transitions. [2022-12-14 11:36:28,438 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1001 transitions. Word has length 10 [2022-12-14 11:36:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:28,438 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 1001 transitions. [2022-12-14 11:36:28,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1001 transitions. [2022-12-14 11:36:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 11:36:28,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:28,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:28,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:36:28,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2099971291, now seen corresponding path program 1 times [2022-12-14 11:36:28,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:28,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142118849] [2022-12-14 11:36:28,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:28,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:29,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142118849] [2022-12-14 11:36:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142118849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:29,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:29,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:36:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624841662] [2022-12-14 11:36:29,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:36:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:36:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:36:29,722 INFO L87 Difference]: Start difference. First operand 342 states and 1001 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:29,892 INFO L93 Difference]: Finished difference Result 375 states and 1101 transitions. [2022-12-14 11:36:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:36:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 11:36:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:29,894 INFO L225 Difference]: With dead ends: 375 [2022-12-14 11:36:29,895 INFO L226 Difference]: Without dead ends: 375 [2022-12-14 11:36:29,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:36:29,895 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:29,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:36:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-12-14 11:36:29,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 343. [2022-12-14 11:36:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 2.891812865497076) internal successors, (989), 342 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 989 transitions. [2022-12-14 11:36:29,904 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 989 transitions. Word has length 11 [2022-12-14 11:36:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:29,904 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 989 transitions. [2022-12-14 11:36:29,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 989 transitions. [2022-12-14 11:36:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:36:29,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:29,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:29,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 11:36:29,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:29,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2019405892, now seen corresponding path program 1 times [2022-12-14 11:36:29,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:29,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980888205] [2022-12-14 11:36:29,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:29,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:30,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:30,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980888205] [2022-12-14 11:36:30,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980888205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:30,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:30,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:36:30,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328648398] [2022-12-14 11:36:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:30,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:36:30,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:36:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:36:30,074 INFO L87 Difference]: Start difference. First operand 343 states and 989 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-12-14 11:36:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:30,170 INFO L93 Difference]: Finished difference Result 326 states and 830 transitions. [2022-12-14 11:36:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:36:30,171 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-12-14 11:36:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:30,172 INFO L225 Difference]: With dead ends: 326 [2022-12-14 11:36:30,172 INFO L226 Difference]: Without dead ends: 246 [2022-12-14 11:36:30,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:36:30,173 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:30,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:36:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-12-14 11:36:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-12-14 11:36:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.489795918367347) internal successors, (610), 245 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 610 transitions. [2022-12-14 11:36:30,178 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 610 transitions. Word has length 12 [2022-12-14 11:36:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:30,178 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 610 transitions. [2022-12-14 11:36:30,179 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-12-14 11:36:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 610 transitions. [2022-12-14 11:36:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:36:30,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:30,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:30,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 11:36:30,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash 931121091, now seen corresponding path program 1 times [2022-12-14 11:36:30,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:30,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416757071] [2022-12-14 11:36:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:30,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:30,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416757071] [2022-12-14 11:36:30,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416757071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:30,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:30,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:36:30,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828256848] [2022-12-14 11:36:30,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:30,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:36:30,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:30,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:36:30,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:36:30,382 INFO L87 Difference]: Start difference. First operand 246 states and 610 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:30,530 INFO L93 Difference]: Finished difference Result 198 states and 449 transitions. [2022-12-14 11:36:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:36:30,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 11:36:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:30,532 INFO L225 Difference]: With dead ends: 198 [2022-12-14 11:36:30,532 INFO L226 Difference]: Without dead ends: 154 [2022-12-14 11:36:30,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:36:30,533 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:30,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 7 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:36:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-12-14 11:36:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-12-14 11:36:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.2222222222222223) internal successors, (340), 153 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 340 transitions. [2022-12-14 11:36:30,540 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 340 transitions. Word has length 14 [2022-12-14 11:36:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:30,541 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 340 transitions. [2022-12-14 11:36:30,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 340 transitions. [2022-12-14 11:36:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:36:30,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:30,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:30,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 11:36:30,542 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:30,543 INFO L85 PathProgramCache]: Analyzing trace with hash 664087570, now seen corresponding path program 1 times [2022-12-14 11:36:30,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:30,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628552620] [2022-12-14 11:36:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:31,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:31,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628552620] [2022-12-14 11:36:31,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628552620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:31,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:31,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:36:31,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361827157] [2022-12-14 11:36:31,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:31,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:36:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:31,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:36:31,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:36:31,698 INFO L87 Difference]: Start difference. First operand 154 states and 340 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:32,018 INFO L93 Difference]: Finished difference Result 307 states and 648 transitions. [2022-12-14 11:36:32,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:36:32,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:36:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:32,021 INFO L225 Difference]: With dead ends: 307 [2022-12-14 11:36:32,021 INFO L226 Difference]: Without dead ends: 307 [2022-12-14 11:36:32,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:36:32,022 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 44 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:32,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 20 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:36:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-14 11:36:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 176. [2022-12-14 11:36:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.1942857142857144) internal successors, (384), 175 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 384 transitions. [2022-12-14 11:36:32,028 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 384 transitions. Word has length 16 [2022-12-14 11:36:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:32,029 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 384 transitions. [2022-12-14 11:36:32,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 384 transitions. [2022-12-14 11:36:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:36:32,029 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:32,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:32,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:36:32,030 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1944238236, now seen corresponding path program 2 times [2022-12-14 11:36:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:32,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606997825] [2022-12-14 11:36:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:32,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:32,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606997825] [2022-12-14 11:36:32,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606997825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:32,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:32,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:36:32,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258027459] [2022-12-14 11:36:32,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:32,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:36:32,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:32,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:36:32,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:36:32,899 INFO L87 Difference]: Start difference. First operand 176 states and 384 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:33,271 INFO L93 Difference]: Finished difference Result 303 states and 639 transitions. [2022-12-14 11:36:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:36:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:36:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:33,274 INFO L225 Difference]: With dead ends: 303 [2022-12-14 11:36:33,274 INFO L226 Difference]: Without dead ends: 275 [2022-12-14 11:36:33,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:36:33,275 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:33,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 24 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:36:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-12-14 11:36:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 184. [2022-12-14 11:36:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.185792349726776) internal successors, (400), 183 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 400 transitions. [2022-12-14 11:36:33,279 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 400 transitions. Word has length 16 [2022-12-14 11:36:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:33,279 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 400 transitions. [2022-12-14 11:36:33,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 400 transitions. [2022-12-14 11:36:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:36:33,280 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:33,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:33,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 11:36:33,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:33,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1847827189, now seen corresponding path program 1 times [2022-12-14 11:36:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:33,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902680354] [2022-12-14 11:36:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:33,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:33,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902680354] [2022-12-14 11:36:33,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902680354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:33,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:33,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:36:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187235586] [2022-12-14 11:36:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:33,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:36:33,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:36:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:36:33,394 INFO L87 Difference]: Start difference. First operand 184 states and 400 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:33,458 INFO L93 Difference]: Finished difference Result 241 states and 509 transitions. [2022-12-14 11:36:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:36:33,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:36:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:33,460 INFO L225 Difference]: With dead ends: 241 [2022-12-14 11:36:33,460 INFO L226 Difference]: Without dead ends: 158 [2022-12-14 11:36:33,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:36:33,461 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:33,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:36:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-14 11:36:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2022-12-14 11:36:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.0584415584415585) internal successors, (317), 154 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 317 transitions. [2022-12-14 11:36:33,465 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 317 transitions. Word has length 16 [2022-12-14 11:36:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:33,465 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 317 transitions. [2022-12-14 11:36:33,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 317 transitions. [2022-12-14 11:36:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:36:33,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:33,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:33,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 11:36:33,467 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:33,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1020975378, now seen corresponding path program 3 times [2022-12-14 11:36:33,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:33,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816474489] [2022-12-14 11:36:33,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:33,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:33,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:33,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816474489] [2022-12-14 11:36:33,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816474489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:33,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:33,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:36:33,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026959148] [2022-12-14 11:36:33,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:33,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:36:33,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:33,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:36:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:36:33,782 INFO L87 Difference]: Start difference. First operand 155 states and 317 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:33,953 INFO L93 Difference]: Finished difference Result 304 states and 601 transitions. [2022-12-14 11:36:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:36:33,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:36:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:33,954 INFO L225 Difference]: With dead ends: 304 [2022-12-14 11:36:33,954 INFO L226 Difference]: Without dead ends: 241 [2022-12-14 11:36:33,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:36:33,955 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:33,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:36:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-12-14 11:36:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 171. [2022-12-14 11:36:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.0470588235294116) internal successors, (348), 170 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 348 transitions. [2022-12-14 11:36:33,958 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 348 transitions. Word has length 16 [2022-12-14 11:36:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:33,959 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 348 transitions. [2022-12-14 11:36:33,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 348 transitions. [2022-12-14 11:36:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:36:33,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:33,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:33,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 11:36:33,959 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash 840160680, now seen corresponding path program 4 times [2022-12-14 11:36:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:33,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091202344] [2022-12-14 11:36:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:34,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091202344] [2022-12-14 11:36:34,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091202344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:34,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:34,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:36:34,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101614390] [2022-12-14 11:36:34,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:34,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:36:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:36:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:36:34,115 INFO L87 Difference]: Start difference. First operand 171 states and 348 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:34,230 INFO L93 Difference]: Finished difference Result 154 states and 312 transitions. [2022-12-14 11:36:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:36:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:36:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:34,231 INFO L225 Difference]: With dead ends: 154 [2022-12-14 11:36:34,231 INFO L226 Difference]: Without dead ends: 84 [2022-12-14 11:36:34,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:36:34,232 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:34,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:36:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-14 11:36:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-12-14 11:36:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.9759036144578312) internal successors, (164), 83 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 164 transitions. [2022-12-14 11:36:34,234 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 164 transitions. Word has length 16 [2022-12-14 11:36:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:34,234 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 164 transitions. [2022-12-14 11:36:34,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 164 transitions. [2022-12-14 11:36:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:36:34,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:34,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:34,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 11:36:34,235 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:34,235 INFO L85 PathProgramCache]: Analyzing trace with hash 312441316, now seen corresponding path program 1 times [2022-12-14 11:36:34,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:34,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482234674] [2022-12-14 11:36:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:35,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:35,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482234674] [2022-12-14 11:36:35,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482234674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:35,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:35,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:36:35,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299990047] [2022-12-14 11:36:35,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:35,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 11:36:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 11:36:35,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:36:35,521 INFO L87 Difference]: Start difference. First operand 84 states and 164 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:35,988 INFO L93 Difference]: Finished difference Result 151 states and 277 transitions. [2022-12-14 11:36:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:36:35,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 11:36:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:35,989 INFO L225 Difference]: With dead ends: 151 [2022-12-14 11:36:35,989 INFO L226 Difference]: Without dead ends: 93 [2022-12-14 11:36:35,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:36:35,990 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:35,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 18 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:36:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-14 11:36:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2022-12-14 11:36:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.943661971830986) internal successors, (138), 71 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-12-14 11:36:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 138 transitions. [2022-12-14 11:36:35,991 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 138 transitions. Word has length 19 [2022-12-14 11:36:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:35,992 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 138 transitions. [2022-12-14 11:36:35,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 138 transitions. [2022-12-14 11:36:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:36:35,992 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:35,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:35,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 11:36:35,994 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:35,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2011605008, now seen corresponding path program 2 times [2022-12-14 11:36:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:35,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108413610] [2022-12-14 11:36:35,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:35,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:37,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-12-14 11:36:37,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:37,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108413610] [2022-12-14 11:36:37,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108413610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:37,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:37,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:36:37,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192219112] [2022-12-14 11:36:37,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:37,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 11:36:37,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:37,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 11:36:37,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:36:37,314 INFO L87 Difference]: Start difference. First operand 72 states and 138 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:37,550 INFO L93 Difference]: Finished difference Result 101 states and 187 transitions. [2022-12-14 11:36:37,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:36:37,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 11:36:37,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:37,551 INFO L225 Difference]: With dead ends: 101 [2022-12-14 11:36:37,551 INFO L226 Difference]: Without dead ends: 87 [2022-12-14 11:36:37,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:36:37,551 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:37,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 17 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:36:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-14 11:36:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2022-12-14 11:36:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 71 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 136 transitions. [2022-12-14 11:36:37,554 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 136 transitions. Word has length 19 [2022-12-14 11:36:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:37,554 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 136 transitions. [2022-12-14 11:36:37,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 136 transitions. [2022-12-14 11:36:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:36:37,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:37,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:37,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 11:36:37,554 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash -821452210, now seen corresponding path program 3 times [2022-12-14 11:36:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:37,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870065841] [2022-12-14 11:36:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:37,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:36:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:36:38,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:36:38,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870065841] [2022-12-14 11:36:38,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870065841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:36:38,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:36:38,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:36:38,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648425749] [2022-12-14 11:36:38,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:36:38,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 11:36:38,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:36:38,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 11:36:38,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:36:38,858 INFO L87 Difference]: Start difference. First operand 72 states and 136 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:36:39,157 INFO L93 Difference]: Finished difference Result 130 states and 241 transitions. [2022-12-14 11:36:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 11:36:39,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 11:36:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:36:39,158 INFO L225 Difference]: With dead ends: 130 [2022-12-14 11:36:39,158 INFO L226 Difference]: Without dead ends: 89 [2022-12-14 11:36:39,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:36:39,158 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:36:39,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:36:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-14 11:36:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-12-14 11:36:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.876923076923077) internal successors, (122), 65 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 122 transitions. [2022-12-14 11:36:39,160 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 122 transitions. Word has length 19 [2022-12-14 11:36:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:36:39,160 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 122 transitions. [2022-12-14 11:36:39,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:36:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 122 transitions. [2022-12-14 11:36:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:36:39,160 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:36:39,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:39,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 11:36:39,161 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 11:36:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:36:39,161 INFO L85 PathProgramCache]: Analyzing trace with hash 573324592, now seen corresponding path program 4 times [2022-12-14 11:36:39,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:36:39,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432027212] [2022-12-14 11:36:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:36:39,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:36:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:36:39,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 11:36:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:36:39,264 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 11:36:39,265 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 11:36:39,265 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-14 11:36:39,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-14 11:36:39,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-14 11:36:39,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-14 11:36:39,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-14 11:36:39,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-14 11:36:39,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 11:36:39,269 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:36:39,273 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 11:36:39,273 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:36:39,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:36:39 BasicIcfg [2022-12-14 11:36:39,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:36:39,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:36:39,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:36:39,326 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:36:39,327 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:36:19" (3/4) ... [2022-12-14 11:36:39,328 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 11:36:39,404 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 11:36:39,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:36:39,404 INFO L158 Benchmark]: Toolchain (without parser) took 20722.97ms. Allocated memory was 157.3MB in the beginning and 343.9MB in the end (delta: 186.6MB). Free memory was 114.7MB in the beginning and 228.6MB in the end (delta: -113.8MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2022-12-14 11:36:39,405 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:36:39,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.84ms. Allocated memory is still 157.3MB. Free memory was 114.7MB in the beginning and 86.5MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 11:36:39,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.04ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 83.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 11:36:39,405 INFO L158 Benchmark]: Boogie Preprocessor took 23.06ms. Allocated memory is still 157.3MB. Free memory was 83.8MB in the beginning and 81.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:36:39,405 INFO L158 Benchmark]: RCFGBuilder took 704.99ms. Allocated memory is still 157.3MB. Free memory was 81.2MB in the beginning and 120.4MB in the end (delta: -39.2MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-12-14 11:36:39,405 INFO L158 Benchmark]: TraceAbstraction took 19496.27ms. Allocated memory was 157.3MB in the beginning and 343.9MB in the end (delta: 186.6MB). Free memory was 119.2MB in the beginning and 245.3MB in the end (delta: -126.1MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2022-12-14 11:36:39,406 INFO L158 Benchmark]: Witness Printer took 78.13ms. Allocated memory is still 343.9MB. Free memory was 245.3MB in the beginning and 228.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 11:36:39,407 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.13ms. Allocated memory is still 113.2MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.84ms. Allocated memory is still 157.3MB. Free memory was 114.7MB in the beginning and 86.5MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.04ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 83.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.06ms. Allocated memory is still 157.3MB. Free memory was 83.8MB in the beginning and 81.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 704.99ms. Allocated memory is still 157.3MB. Free memory was 81.2MB in the beginning and 120.4MB in the end (delta: -39.2MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19496.27ms. Allocated memory was 157.3MB in the beginning and 343.9MB in the end (delta: 186.6MB). Free memory was 119.2MB in the beginning and 245.3MB in the end (delta: -126.1MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * Witness Printer took 78.13ms. Allocated memory is still 343.9MB. Free memory was 245.3MB in the beginning and 228.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 139 PlacesBefore, 34 PlacesAfterwards, 131 TransitionsBefore, 25 TransitionsAfterwards, 1852 CoEnabledTransitionPairs, 8 FixpointIterations, 59 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 4837 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2195, independent: 1992, independent conditional: 0, independent unconditional: 1992, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1293, independent: 1230, independent conditional: 0, independent unconditional: 1230, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1293, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 596, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 554, dependent conditional: 0, dependent unconditional: 554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2195, independent: 762, independent conditional: 0, independent unconditional: 762, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 1293, unknown conditional: 0, unknown unconditional: 1293] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2257, ((void *)0), P0, ((void *)0))=-1, t2257={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2258; [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2258, ((void *)0), P1, ((void *)0))=0, t2257={7:0}, t2258={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2259; [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2259, ((void *)0), P2, ((void *)0))=1, t2257={7:0}, t2258={8:0}, t2259={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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L801] 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) [L801] 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) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 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) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] 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) [L870] 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) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 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 [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2257={7:0}, t2258={8:0}, t2259={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1863 IncrementalHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 32 mSDtfsCounter, 1863 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=0, InterpolantAutomatonStates: 84, 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, 14 MinimizatonAttempts, 386 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 2972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 11:36:39,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0f10c3-7aa1-46a4-b654-453fd1dffad5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE