./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/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_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/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_f7a00f8d-6ed5-4d90-adec-d5922355d9af/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 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- 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 08:32:26,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:32:26,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:32:26,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:32:26,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:32:26,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:32:26,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:32:26,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:32:26,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:32:26,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:32:26,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:32:26,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:32:26,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:32:26,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:32:26,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:32:26,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:32:26,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:32:26,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:32:26,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:32:26,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:32:26,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:32:26,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:32:26,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:32:26,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:32:26,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:32:26,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:32:26,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:32:26,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:32:26,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:32:26,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:32:26,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:32:26,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:32:26,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:32:26,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:32:26,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:32:26,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:32:26,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:32:26,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:32:26,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:32:26,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:32:26,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:32:26,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 08:32:27,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:32:27,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:32:27,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:32:27,011 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:32:27,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:32:27,012 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:32:27,013 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:32:27,013 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:32:27,013 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:32:27,013 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:32:27,013 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:32:27,014 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:32:27,014 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:32:27,014 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:32:27,014 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:32:27,014 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:32:27,015 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:32:27,015 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:32:27,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:32:27,016 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:32:27,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:32:27,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:32:27,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:32:27,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 08:32:27,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:32:27,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 08:32:27,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:32:27,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 08:32:27,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:32:27,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 08:32:27,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:32:27,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:32:27,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:32:27,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:32:27,019 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:32:27,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:32:27,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 08:32:27,019 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:32:27,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:32:27,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 08:32:27,020 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:32:27,020 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_f7a00f8d-6ed5-4d90-adec-d5922355d9af/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_f7a00f8d-6ed5-4d90-adec-d5922355d9af/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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2022-12-14 08:32:27,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:32:27,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:32:27,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:32:27,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:32:27,237 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:32:27,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-12-14 08:32:29,795 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:32:30,003 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:32:30,003 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-12-14 08:32:30,016 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/data/efb4c7c6f/cd1c99cc782b45b190e25099b3c7b4cb/FLAGe1ba7410f [2022-12-14 08:32:30,030 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/data/efb4c7c6f/cd1c99cc782b45b190e25099b3c7b4cb [2022-12-14 08:32:30,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:32:30,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:32:30,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:32:30,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:32:30,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:32:30,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6b7bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30, skipping insertion in model container [2022-12-14 08:32:30,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:32:30,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:32:30,218 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_f7a00f8d-6ed5-4d90-adec-d5922355d9af/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-12-14 08:32:30,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:32:30,363 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:32:30,372 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_f7a00f8d-6ed5-4d90-adec-d5922355d9af/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-12-14 08:32:30,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:32:30,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:32:30,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:32:30,433 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:32:30,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30 WrapperNode [2022-12-14 08:32:30,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:32:30,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:32:30,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:32:30,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:32:30,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,469 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-12-14 08:32:30,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:32:30,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:32:30,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:32:30,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:32:30,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,506 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:32:30,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:32:30,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:32:30,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:32:30,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (1/1) ... [2022-12-14 08:32:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:32:30,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:32:30,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:32:30,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:32:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 08:32:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 08:32:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 08:32:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:32:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 08:32:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 08:32:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 08:32:30,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 08:32:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 08:32:30,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 08:32:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 08:32:30,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 08:32:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 08:32:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 08:32:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:32:30,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:32:30,581 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 08:32:30,696 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:32:30,697 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:32:31,040 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:32:31,206 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:32:31,207 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 08:32:31,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:32:31 BoogieIcfgContainer [2022-12-14 08:32:31,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:32:31,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:32:31,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:32:31,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:32:31,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:32:30" (1/3) ... [2022-12-14 08:32:31,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b211592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:32:31, skipping insertion in model container [2022-12-14 08:32:31,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:32:30" (2/3) ... [2022-12-14 08:32:31,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b211592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:32:31, skipping insertion in model container [2022-12-14 08:32:31,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:32:31" (3/3) ... [2022-12-14 08:32:31,214 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2022-12-14 08:32:31,221 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 08:32:31,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:32:31,229 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 08:32:31,229 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 08:32:31,280 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 08:32:31,303 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 08:32:31,313 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 134 transitions, 283 flow [2022-12-14 08:32:31,316 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 134 transitions, 283 flow [2022-12-14 08:32:31,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 134 transitions, 283 flow [2022-12-14 08:32:31,353 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-12-14 08:32:31,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 08:32:31,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-14 08:32:31,359 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-14 08:32:39,516 INFO L134 LiptonReduction]: Checked pairs total: 6560 [2022-12-14 08:32:39,516 INFO L136 LiptonReduction]: Total number of compositions: 122 [2022-12-14 08:32:39,523 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2022-12-14 08:32:39,563 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 749 states, 746 states have (on average 3.233243967828418) internal successors, (2412), 748 states have internal predecessors, (2412), 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 08:32:39,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:32:39,581 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;@1bb0bde8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:32:39,581 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-14 08:32:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 749 states, 746 states have (on average 3.233243967828418) internal successors, (2412), 748 states have internal predecessors, (2412), 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 08:32:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 08:32:39,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:39,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 08:32:39,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 26166010, now seen corresponding path program 1 times [2022-12-14 08:32:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:39,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492920851] [2022-12-14 08:32:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:39,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:39,851 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 08:32:39,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:39,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492920851] [2022-12-14 08:32:39,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492920851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:39,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:39,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:32:39,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939826641] [2022-12-14 08:32:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:39,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:32:39,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:39,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:32:39,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:32:39,875 INFO L87 Difference]: Start difference. First operand has 749 states, 746 states have (on average 3.233243967828418) internal successors, (2412), 748 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:39,978 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2022-12-14 08:32:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:32:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 08:32:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:39,994 INFO L225 Difference]: With dead ends: 612 [2022-12-14 08:32:39,994 INFO L226 Difference]: Without dead ends: 562 [2022-12-14 08:32:39,995 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 08:32:39,998 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:39,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-12-14 08:32:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-12-14 08:32:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.0748663101604277) internal successors, (1725), 561 states have internal predecessors, (1725), 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 08:32:40,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2022-12-14 08:32:40,064 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 4 [2022-12-14 08:32:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:40,064 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2022-12-14 08:32:40,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2022-12-14 08:32:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 08:32:40,075 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:40,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:40,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 08:32:40,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:40,076 INFO L85 PathProgramCache]: Analyzing trace with hash -186252107, now seen corresponding path program 1 times [2022-12-14 08:32:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:40,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550921893] [2022-12-14 08:32:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:40,251 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 08:32:40,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:40,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550921893] [2022-12-14 08:32:40,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550921893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:40,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:40,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:32:40,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035004530] [2022-12-14 08:32:40,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:40,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:32:40,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:40,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:32:40,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:32:40,254 INFO L87 Difference]: Start difference. First operand 562 states and 1725 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 08:32:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:40,323 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2022-12-14 08:32:40,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:32:40,324 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 08:32:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:40,326 INFO L225 Difference]: With dead ends: 537 [2022-12-14 08:32:40,326 INFO L226 Difference]: Without dead ends: 537 [2022-12-14 08:32:40,326 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 08:32:40,327 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:40,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-12-14 08:32:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-12-14 08:32:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 3.050373134328358) internal successors, (1635), 536 states have internal predecessors, (1635), 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 08:32:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2022-12-14 08:32:40,343 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 9 [2022-12-14 08:32:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:40,344 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2022-12-14 08:32:40,344 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 08:32:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2022-12-14 08:32:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 08:32:40,345 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:40,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:40,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 08:32:40,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1478849041, now seen corresponding path program 1 times [2022-12-14 08:32:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:40,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394569126] [2022-12-14 08:32:40,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:40,446 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 08:32:40,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:40,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394569126] [2022-12-14 08:32:40,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394569126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:40,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:40,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:32:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698199932] [2022-12-14 08:32:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:40,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:32:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:32:40,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:32:40,448 INFO L87 Difference]: Start difference. First operand 537 states and 1635 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 08:32:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:40,510 INFO L93 Difference]: Finished difference Result 517 states and 1564 transitions. [2022-12-14 08:32:40,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:32:40,511 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 08:32:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:40,513 INFO L225 Difference]: With dead ends: 517 [2022-12-14 08:32:40,513 INFO L226 Difference]: Without dead ends: 517 [2022-12-14 08:32:40,514 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 08:32:40,514 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:40,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-12-14 08:32:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2022-12-14 08:32:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 3.0310077519379846) internal successors, (1564), 516 states have internal predecessors, (1564), 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 08:32:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1564 transitions. [2022-12-14 08:32:40,526 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1564 transitions. Word has length 10 [2022-12-14 08:32:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:40,527 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 1564 transitions. [2022-12-14 08:32:40,527 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 08:32:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1564 transitions. [2022-12-14 08:32:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 08:32:40,528 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:40,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:40,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 08:32:40,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1368494489, now seen corresponding path program 1 times [2022-12-14 08:32:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:40,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559914732] [2022-12-14 08:32:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:40,631 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 08:32:40,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:40,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559914732] [2022-12-14 08:32:40,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559914732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:40,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:40,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:32:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847455449] [2022-12-14 08:32:40,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:40,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:32:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:40,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:32:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:32:40,633 INFO L87 Difference]: Start difference. First operand 517 states and 1564 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 08:32:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:40,725 INFO L93 Difference]: Finished difference Result 665 states and 1971 transitions. [2022-12-14 08:32:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:32:40,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 08:32:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:40,728 INFO L225 Difference]: With dead ends: 665 [2022-12-14 08:32:40,729 INFO L226 Difference]: Without dead ends: 365 [2022-12-14 08:32:40,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:32:40,730 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:40,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-12-14 08:32:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-12-14 08:32:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 2.8461538461538463) internal successors, (1036), 364 states have internal predecessors, (1036), 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 08:32:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1036 transitions. [2022-12-14 08:32:40,739 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1036 transitions. Word has length 11 [2022-12-14 08:32:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:40,739 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 1036 transitions. [2022-12-14 08:32:40,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 08:32:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1036 transitions. [2022-12-14 08:32:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:32:40,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:40,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:40,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 08:32:40,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:40,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:40,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1761794535, now seen corresponding path program 1 times [2022-12-14 08:32:40,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:40,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120596430] [2022-12-14 08:32:40,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:40,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:40,857 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 08:32:40,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:40,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120596430] [2022-12-14 08:32:40,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120596430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:40,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:40,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:32:40,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132918795] [2022-12-14 08:32:40,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:40,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:32:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:40,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:32:40,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:32:40,859 INFO L87 Difference]: Start difference. First operand 365 states and 1036 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:40,928 INFO L93 Difference]: Finished difference Result 353 states and 995 transitions. [2022-12-14 08:32:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:32:40,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 08:32:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:40,931 INFO L225 Difference]: With dead ends: 353 [2022-12-14 08:32:40,932 INFO L226 Difference]: Without dead ends: 353 [2022-12-14 08:32:40,932 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 08:32:40,932 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:40,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-12-14 08:32:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2022-12-14 08:32:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.8267045454545454) internal successors, (995), 352 states have internal predecessors, (995), 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 08:32:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 995 transitions. [2022-12-14 08:32:40,940 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 995 transitions. Word has length 13 [2022-12-14 08:32:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:40,940 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 995 transitions. [2022-12-14 08:32:40,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 995 transitions. [2022-12-14 08:32:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 08:32:40,941 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:40,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:40,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 08:32:40,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:40,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:40,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1218887505, now seen corresponding path program 1 times [2022-12-14 08:32:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:40,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343889316] [2022-12-14 08:32:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:41,813 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 08:32:41,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:41,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343889316] [2022-12-14 08:32:41,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343889316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:41,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:41,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:32:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346645048] [2022-12-14 08:32:41,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:41,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:32:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:32:41,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:32:41,815 INFO L87 Difference]: Start difference. First operand 353 states and 995 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 08:32:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:42,005 INFO L93 Difference]: Finished difference Result 400 states and 1136 transitions. [2022-12-14 08:32:42,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:32:42,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 08:32:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:42,008 INFO L225 Difference]: With dead ends: 400 [2022-12-14 08:32:42,008 INFO L226 Difference]: Without dead ends: 400 [2022-12-14 08:32:42,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:32:42,009 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:42,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 10 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:32:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-12-14 08:32:42,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 360. [2022-12-14 08:32:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.796657381615599) internal successors, (1004), 359 states have internal predecessors, (1004), 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 08:32:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 1004 transitions. [2022-12-14 08:32:42,022 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 1004 transitions. Word has length 14 [2022-12-14 08:32:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:42,022 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 1004 transitions. [2022-12-14 08:32:42,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 08:32:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 1004 transitions. [2022-12-14 08:32:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 08:32:42,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:42,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:42,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 08:32:42,024 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash -970968021, now seen corresponding path program 1 times [2022-12-14 08:32:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:42,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011748811] [2022-12-14 08:32:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:42,957 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 08:32:42,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:42,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011748811] [2022-12-14 08:32:42,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011748811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:42,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:42,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:32:42,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279267856] [2022-12-14 08:32:42,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:42,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:32:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:42,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:32:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:32:42,958 INFO L87 Difference]: Start difference. First operand 360 states and 1004 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:43,169 INFO L93 Difference]: Finished difference Result 376 states and 1057 transitions. [2022-12-14 08:32:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:32:43,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 08:32:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:43,171 INFO L225 Difference]: With dead ends: 376 [2022-12-14 08:32:43,171 INFO L226 Difference]: Without dead ends: 376 [2022-12-14 08:32:43,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:32:43,171 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:43,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 14 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:32:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-12-14 08:32:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 372. [2022-12-14 08:32:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 2.8194070080862534) internal successors, (1046), 371 states have internal predecessors, (1046), 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 08:32:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1046 transitions. [2022-12-14 08:32:43,179 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1046 transitions. Word has length 15 [2022-12-14 08:32:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:43,179 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 1046 transitions. [2022-12-14 08:32:43,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1046 transitions. [2022-12-14 08:32:43,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 08:32:43,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:43,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:43,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 08:32:43,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1398840583, now seen corresponding path program 2 times [2022-12-14 08:32:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:43,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882166399] [2022-12-14 08:32:43,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:43,286 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 08:32:43,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:43,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882166399] [2022-12-14 08:32:43,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882166399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:43,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:43,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:32:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153634407] [2022-12-14 08:32:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:43,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:32:43,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:43,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:32:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:32:43,288 INFO L87 Difference]: Start difference. First operand 372 states and 1046 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:43,367 INFO L93 Difference]: Finished difference Result 587 states and 1647 transitions. [2022-12-14 08:32:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:32:43,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 08:32:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:43,370 INFO L225 Difference]: With dead ends: 587 [2022-12-14 08:32:43,371 INFO L226 Difference]: Without dead ends: 307 [2022-12-14 08:32:43,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:32:43,371 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:43,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-14 08:32:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-12-14 08:32:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 2.8137254901960786) internal successors, (861), 306 states have internal predecessors, (861), 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 08:32:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 861 transitions. [2022-12-14 08:32:43,378 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 861 transitions. Word has length 15 [2022-12-14 08:32:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:43,378 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 861 transitions. [2022-12-14 08:32:43,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 861 transitions. [2022-12-14 08:32:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 08:32:43,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:43,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:43,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 08:32:43,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1175283102, now seen corresponding path program 1 times [2022-12-14 08:32:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:43,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834396271] [2022-12-14 08:32:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:43,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:44,470 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 08:32:44,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:44,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834396271] [2022-12-14 08:32:44,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834396271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:44,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:44,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 08:32:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310468602] [2022-12-14 08:32:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:44,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 08:32:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:44,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 08:32:44,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 08:32:44,472 INFO L87 Difference]: Start difference. First operand 307 states and 861 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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 08:32:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:44,607 INFO L93 Difference]: Finished difference Result 351 states and 1000 transitions. [2022-12-14 08:32:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:32:44,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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 08:32:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:44,609 INFO L225 Difference]: With dead ends: 351 [2022-12-14 08:32:44,609 INFO L226 Difference]: Without dead ends: 351 [2022-12-14 08:32:44,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:32:44,609 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:44,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-12-14 08:32:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 310. [2022-12-14 08:32:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.8155339805825244) internal successors, (870), 309 states have internal predecessors, (870), 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 08:32:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 870 transitions. [2022-12-14 08:32:44,616 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 870 transitions. Word has length 16 [2022-12-14 08:32:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:44,617 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 870 transitions. [2022-12-14 08:32:44,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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 08:32:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 870 transitions. [2022-12-14 08:32:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 08:32:44,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:44,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:44,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 08:32:44,618 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:44,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1175283536, now seen corresponding path program 1 times [2022-12-14 08:32:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:44,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111436273] [2022-12-14 08:32:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:44,799 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 08:32:44,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:44,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111436273] [2022-12-14 08:32:44,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111436273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:44,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:44,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:32:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487133438] [2022-12-14 08:32:44,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:44,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:32:44,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:44,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:32:44,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:32:44,801 INFO L87 Difference]: Start difference. First operand 310 states and 870 transitions. Second operand has 4 states, 4 states have (on average 4.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 08:32:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:44,907 INFO L93 Difference]: Finished difference Result 304 states and 760 transitions. [2022-12-14 08:32:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:32:44,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.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 08:32:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:44,909 INFO L225 Difference]: With dead ends: 304 [2022-12-14 08:32:44,909 INFO L226 Difference]: Without dead ends: 227 [2022-12-14 08:32:44,909 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 08:32:44,909 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:44,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-12-14 08:32:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-12-14 08:32:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 2.4513274336283186) internal successors, (554), 226 states have internal predecessors, (554), 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 08:32:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 554 transitions. [2022-12-14 08:32:44,914 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 554 transitions. Word has length 16 [2022-12-14 08:32:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:44,914 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 554 transitions. [2022-12-14 08:32:44,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.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 08:32:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 554 transitions. [2022-12-14 08:32:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 08:32:44,915 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:44,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:44,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 08:32:44,915 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash 718790876, now seen corresponding path program 1 times [2022-12-14 08:32:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:44,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528200717] [2022-12-14 08:32:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:45,735 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 08:32:45,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:45,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528200717] [2022-12-14 08:32:45,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528200717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:45,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:45,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 08:32:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511243429] [2022-12-14 08:32:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:45,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 08:32:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 08:32:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 08:32:45,736 INFO L87 Difference]: Start difference. First operand 227 states and 554 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:45,851 INFO L93 Difference]: Finished difference Result 263 states and 647 transitions. [2022-12-14 08:32:45,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:32:45,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 08:32:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:45,852 INFO L225 Difference]: With dead ends: 263 [2022-12-14 08:32:45,852 INFO L226 Difference]: Without dead ends: 263 [2022-12-14 08:32:45,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:32:45,853 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:45,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-12-14 08:32:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 251. [2022-12-14 08:32:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 2.48) internal successors, (620), 250 states have internal predecessors, (620), 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 08:32:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 620 transitions. [2022-12-14 08:32:45,858 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 620 transitions. Word has length 17 [2022-12-14 08:32:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:45,858 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 620 transitions. [2022-12-14 08:32:45,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 620 transitions. [2022-12-14 08:32:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 08:32:45,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:45,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:45,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 08:32:45,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:45,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1283746860, now seen corresponding path program 2 times [2022-12-14 08:32:45,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:45,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912233365] [2022-12-14 08:32:45,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:46,757 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 08:32:46,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:46,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912233365] [2022-12-14 08:32:46,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912233365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:46,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:46,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 08:32:46,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890879538] [2022-12-14 08:32:46,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:46,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 08:32:46,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:46,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 08:32:46,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 08:32:46,759 INFO L87 Difference]: Start difference. First operand 251 states and 620 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:46,914 INFO L93 Difference]: Finished difference Result 259 states and 643 transitions. [2022-12-14 08:32:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:32:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 08:32:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:46,916 INFO L225 Difference]: With dead ends: 259 [2022-12-14 08:32:46,916 INFO L226 Difference]: Without dead ends: 259 [2022-12-14 08:32:46,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:32:46,917 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:46,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-12-14 08:32:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2022-12-14 08:32:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 2.4881889763779528) internal successors, (632), 254 states have internal predecessors, (632), 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 08:32:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 632 transitions. [2022-12-14 08:32:46,924 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 632 transitions. Word has length 17 [2022-12-14 08:32:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:46,924 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 632 transitions. [2022-12-14 08:32:46,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 632 transitions. [2022-12-14 08:32:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 08:32:46,925 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:46,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:46,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 08:32:46,926 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:46,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1270698402, now seen corresponding path program 1 times [2022-12-14 08:32:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:46,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459202306] [2022-12-14 08:32:46,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:47,088 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 08:32:47,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:47,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459202306] [2022-12-14 08:32:47,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459202306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:47,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:47,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:32:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402312127] [2022-12-14 08:32:47,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:47,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:32:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:47,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:32:47,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:32:47,089 INFO L87 Difference]: Start difference. First operand 255 states and 632 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:47,210 INFO L93 Difference]: Finished difference Result 214 states and 487 transitions. [2022-12-14 08:32:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:32:47,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 08:32:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:47,211 INFO L225 Difference]: With dead ends: 214 [2022-12-14 08:32:47,211 INFO L226 Difference]: Without dead ends: 164 [2022-12-14 08:32:47,211 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 08:32:47,212 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 9 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 08:32:47,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 9 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-14 08:32:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2022-12-14 08:32:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.1812080536912752) internal successors, (325), 149 states have internal predecessors, (325), 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 08:32:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 325 transitions. [2022-12-14 08:32:47,216 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 325 transitions. Word has length 17 [2022-12-14 08:32:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:47,216 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 325 transitions. [2022-12-14 08:32:47,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:32:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 325 transitions. [2022-12-14 08:32:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 08:32:47,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:47,217 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 08:32:47,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 08:32:47,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:47,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2136420691, now seen corresponding path program 1 times [2022-12-14 08:32:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:47,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091736029] [2022-12-14 08:32:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:32:47,443 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 08:32:47,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:32:47,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091736029] [2022-12-14 08:32:47,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091736029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:32:47,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:32:47,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:32:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227915701] [2022-12-14 08:32:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:32:47,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:32:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:32:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:32:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:32:47,445 INFO L87 Difference]: Start difference. First operand 150 states and 325 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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 08:32:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:32:47,543 INFO L93 Difference]: Finished difference Result 134 states and 291 transitions. [2022-12-14 08:32:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:32:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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 08:32:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:32:47,544 INFO L225 Difference]: With dead ends: 134 [2022-12-14 08:32:47,544 INFO L226 Difference]: Without dead ends: 122 [2022-12-14 08:32:47,544 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 08:32:47,544 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:32:47,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:32:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-14 08:32:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2022-12-14 08:32:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.230769230769231) internal successors, (261), 117 states have internal predecessors, (261), 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 08:32:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 261 transitions. [2022-12-14 08:32:47,547 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 261 transitions. Word has length 19 [2022-12-14 08:32:47,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:32:47,547 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 261 transitions. [2022-12-14 08:32:47,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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 08:32:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 261 transitions. [2022-12-14 08:32:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 08:32:47,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:32:47,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:47,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 08:32:47,548 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-14 08:32:47,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:32:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash -731294737, now seen corresponding path program 1 times [2022-12-14 08:32:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:32:47,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681065413] [2022-12-14 08:32:47,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:32:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:32:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 08:32:47,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 08:32:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 08:32:47,663 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 08:32:47,663 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 08:32:47,664 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-14 08:32:47,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-14 08:32:47,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-14 08:32:47,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-14 08:32:47,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-14 08:32:47,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-14 08:32:47,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 08:32:47,668 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:32:47,672 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 08:32:47,672 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 08:32:47,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 08:32:47 BasicIcfg [2022-12-14 08:32:47,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 08:32:47,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 08:32:47,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 08:32:47,717 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 08:32:47,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:32:31" (3/4) ... [2022-12-14 08:32:47,719 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 08:32:47,774 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 08:32:47,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 08:32:47,774 INFO L158 Benchmark]: Toolchain (without parser) took 17739.89ms. Allocated memory was 142.6MB in the beginning and 308.3MB in the end (delta: 165.7MB). Free memory was 100.0MB in the beginning and 165.1MB in the end (delta: -65.1MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2022-12-14 08:32:47,775 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 08:32:47,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.84ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 72.3MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 08:32:47,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.33ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 69.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:32:47,776 INFO L158 Benchmark]: Boogie Preprocessor took 40.61ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 69.6MB in the beginning and 146.1MB in the end (delta: -76.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-12-14 08:32:47,776 INFO L158 Benchmark]: RCFGBuilder took 697.72ms. Allocated memory is still 176.2MB. Free memory was 146.1MB in the beginning and 131.1MB in the end (delta: 15.0MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2022-12-14 08:32:47,776 INFO L158 Benchmark]: TraceAbstraction took 16506.19ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 130.0MB in the beginning and 180.8MB in the end (delta: -50.7MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2022-12-14 08:32:47,777 INFO L158 Benchmark]: Witness Printer took 57.36ms. Allocated memory is still 308.3MB. Free memory was 180.8MB in the beginning and 165.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 08:32:47,778 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.84ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 72.3MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.33ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 69.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.61ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 69.6MB in the beginning and 146.1MB in the end (delta: -76.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * RCFGBuilder took 697.72ms. Allocated memory is still 176.2MB. Free memory was 146.1MB in the beginning and 131.1MB in the end (delta: 15.0MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16506.19ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 130.0MB in the beginning and 180.8MB in the end (delta: -50.7MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Witness Printer took 57.36ms. Allocated memory is still 308.3MB. Free memory was 180.8MB in the beginning and 165.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 142 PlacesBefore, 36 PlacesAfterwards, 134 TransitionsBefore, 27 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 122 TotalNumberOfCompositions, 6560 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2876, independent: 2623, independent conditional: 0, independent unconditional: 2623, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1517, independent: 1432, independent conditional: 0, independent unconditional: 1432, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1517, independent: 1410, independent conditional: 0, independent unconditional: 1410, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 832, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 800, dependent conditional: 0, dependent unconditional: 800, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2876, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 1517, unknown conditional: 0, unknown unconditional: 1517] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=8, t1780={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=9, t1780={7:0}, t1781={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t1782; [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=10, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L811] 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) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] 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) [L811] 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) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L760] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={7:0}, t1781={5:0}, t1782={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, 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=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 161 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1070 IncrementalHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 36 mSDtfsCounter, 1070 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=749occurred in iteration=0, InterpolantAutomatonStates: 63, 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, 119 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 2453 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 08:32:47,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a00f8d-6ed5-4d90-adec-d5922355d9af/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