./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/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_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/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_355d20c4-cf08-4b65-8f19-ab1663365490/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 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd --- 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 10:21:29,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:21:29,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:21:29,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:21:29,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:21:29,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:21:29,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:21:29,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:21:29,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:21:29,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:21:29,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:21:29,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:21:29,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:21:29,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:21:29,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:21:29,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:21:29,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:21:29,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:21:29,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:21:29,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:21:29,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:21:29,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:21:29,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:21:29,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:21:29,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:21:29,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:21:29,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:21:29,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:21:29,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:21:29,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:21:29,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:21:29,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:21:29,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:21:29,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:21:29,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:21:29,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:21:29,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:21:29,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:21:29,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:21:29,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:21:29,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:21:29,281 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 10:21:29,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:21:29,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:21:29,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:21:29,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:21:29,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:21:29,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:21:29,298 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:21:29,298 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:21:29,298 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:21:29,299 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:21:29,299 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:21:29,299 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:21:29,299 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:21:29,299 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:21:29,300 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:21:29,300 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:21:29,300 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:21:29,300 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:21:29,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:21:29,301 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:21:29,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:21:29,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:21:29,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:21:29,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 10:21:29,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:21:29,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 10:21:29,302 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:21:29,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 10:21:29,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:21:29,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 10:21:29,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:21:29,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:21:29,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:21:29,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:21:29,308 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:21:29,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:21:29,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 10:21:29,309 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:21:29,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:21:29,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 10:21:29,309 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:21:29,309 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_355d20c4-cf08-4b65-8f19-ab1663365490/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_355d20c4-cf08-4b65-8f19-ab1663365490/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 -> 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd [2022-12-14 10:21:29,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:21:29,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:21:29,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:21:29,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:21:29,484 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:21:29,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/mix014.opt.i [2022-12-14 10:21:32,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:21:32,220 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:21:32,220 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/sv-benchmarks/c/pthread-wmm/mix014.opt.i [2022-12-14 10:21:32,231 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/data/f03331bcf/79d90341a8d64e7abf43496f3e5936c5/FLAGb56fcc647 [2022-12-14 10:21:32,616 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/data/f03331bcf/79d90341a8d64e7abf43496f3e5936c5 [2022-12-14 10:21:32,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:21:32,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:21:32,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:21:32,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:21:32,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:21:32,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:21:32" (1/1) ... [2022-12-14 10:21:32,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef1f0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:32, skipping insertion in model container [2022-12-14 10:21:32,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:21:32" (1/1) ... [2022-12-14 10:21:32,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:21:32,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:21:32,816 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_355d20c4-cf08-4b65-8f19-ab1663365490/sv-benchmarks/c/pthread-wmm/mix014.opt.i[944,957] [2022-12-14 10:21:32,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:21:32,947 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:21:32,956 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_355d20c4-cf08-4b65-8f19-ab1663365490/sv-benchmarks/c/pthread-wmm/mix014.opt.i[944,957] [2022-12-14 10:21:32,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:21:32,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:21:32,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:21:33,022 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:21:33,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33 WrapperNode [2022-12-14 10:21:33,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:21:33,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:21:33,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:21:33,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:21:33,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,061 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-14 10:21:33,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:21:33,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:21:33,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:21:33,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:21:33,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,081 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:21:33,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:21:33,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:21:33,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:21:33,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (1/1) ... [2022-12-14 10:21:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:21:33,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:21:33,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:21:33,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:21:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 10:21:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 10:21:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:21:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 10:21:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 10:21:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 10:21:33,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 10:21:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 10:21:33,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 10:21:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 10:21:33,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 10:21:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 10:21:33,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 10:21:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 10:21:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 10:21:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:21:33,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:21:33,148 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 10:21:33,252 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:21:33,254 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:21:33,515 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:21:33,619 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:21:33,619 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 10:21:33,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:21:33 BoogieIcfgContainer [2022-12-14 10:21:33,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:21:33,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:21:33,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:21:33,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:21:33,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:21:32" (1/3) ... [2022-12-14 10:21:33,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23580d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:21:33, skipping insertion in model container [2022-12-14 10:21:33,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:21:33" (2/3) ... [2022-12-14 10:21:33,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23580d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:21:33, skipping insertion in model container [2022-12-14 10:21:33,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:21:33" (3/3) ... [2022-12-14 10:21:33,630 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2022-12-14 10:21:33,639 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 10:21:33,649 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:21:33,649 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 10:21:33,649 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 10:21:33,689 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 10:21:33,726 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 10:21:33,749 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 294 flow [2022-12-14 10:21:33,752 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 294 flow [2022-12-14 10:21:33,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-12-14 10:21:33,794 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-14 10:21:33,794 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 10:21:33,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-14 10:21:33,801 INFO L119 LiptonReduction]: Number of co-enabled transitions 3074 [2022-12-14 10:21:36,966 INFO L134 LiptonReduction]: Checked pairs total: 8005 [2022-12-14 10:21:36,967 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-12-14 10:21:36,972 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2022-12-14 10:21:37,077 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3170 states, 3167 states have (on average 4.07136090937796) internal successors, (12894), 3169 states have internal predecessors, (12894), 0 states have call successors, (0), 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 10:21:37,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:21:37,096 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;@3b79af4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:21:37,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 10:21:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 3170 states, 3167 states have (on average 4.07136090937796) internal successors, (12894), 3169 states have internal predecessors, (12894), 0 states have call successors, (0), 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 10:21:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:21:37,110 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:37,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:37,111 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash -210033265, now seen corresponding path program 1 times [2022-12-14 10:21:37,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:37,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292403589] [2022-12-14 10:21:37,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:37,418 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 10:21:37,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:37,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292403589] [2022-12-14 10:21:37,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292403589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:37,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:37,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:21:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099879579] [2022-12-14 10:21:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:37,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:21:37,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:21:37,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:21:37,449 INFO L87 Difference]: Start difference. First operand has 3170 states, 3167 states have (on average 4.07136090937796) internal successors, (12894), 3169 states have internal predecessors, (12894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:37,583 INFO L93 Difference]: Finished difference Result 2690 states and 10350 transitions. [2022-12-14 10:21:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:21:37,586 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 10:21:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:37,621 INFO L225 Difference]: With dead ends: 2690 [2022-12-14 10:21:37,621 INFO L226 Difference]: Without dead ends: 2610 [2022-12-14 10:21:37,622 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 10:21:37,625 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:37,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2022-12-14 10:21:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2022-12-14 10:21:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 3.865848984285167) internal successors, (10086), 2609 states have internal predecessors, (10086), 0 states have call successors, (0), 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 10:21:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10086 transitions. [2022-12-14 10:21:37,783 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10086 transitions. Word has length 9 [2022-12-14 10:21:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:37,784 INFO L495 AbstractCegarLoop]: Abstraction has 2610 states and 10086 transitions. [2022-12-14 10:21:37,784 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 10:21:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10086 transitions. [2022-12-14 10:21:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:21:37,787 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:37,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:37,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:21:37,788 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:37,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:37,788 INFO L85 PathProgramCache]: Analyzing trace with hash 669316092, now seen corresponding path program 1 times [2022-12-14 10:21:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:37,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819553921] [2022-12-14 10:21:37,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:37,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:38,002 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 10:21:38,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:38,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819553921] [2022-12-14 10:21:38,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819553921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:38,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:38,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:21:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528110395] [2022-12-14 10:21:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:38,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:21:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:38,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:21:38,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:21:38,005 INFO L87 Difference]: Start difference. First operand 2610 states and 10086 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:38,193 INFO L93 Difference]: Finished difference Result 4538 states and 16618 transitions. [2022-12-14 10:21:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:21:38,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 10:21:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:38,211 INFO L225 Difference]: With dead ends: 4538 [2022-12-14 10:21:38,212 INFO L226 Difference]: Without dead ends: 3754 [2022-12-14 10:21:38,212 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 10:21:38,213 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:38,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 18 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2022-12-14 10:21:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3290. [2022-12-14 10:21:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3289 states have (on average 3.7707509881422925) internal successors, (12402), 3289 states have internal predecessors, (12402), 0 states have call successors, (0), 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 10:21:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 12402 transitions. [2022-12-14 10:21:38,369 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 12402 transitions. Word has length 12 [2022-12-14 10:21:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:38,370 INFO L495 AbstractCegarLoop]: Abstraction has 3290 states and 12402 transitions. [2022-12-14 10:21:38,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 12402 transitions. [2022-12-14 10:21:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:21:38,373 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:38,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:38,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 10:21:38,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1282742838, now seen corresponding path program 1 times [2022-12-14 10:21:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:38,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133456904] [2022-12-14 10:21:38,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:38,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:38,524 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 10:21:38,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:38,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133456904] [2022-12-14 10:21:38,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133456904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:38,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:38,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:21:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459914503] [2022-12-14 10:21:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:38,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:21:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:38,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:21:38,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:21:38,526 INFO L87 Difference]: Start difference. First operand 3290 states and 12402 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:38,724 INFO L93 Difference]: Finished difference Result 3898 states and 14106 transitions. [2022-12-14 10:21:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:21:38,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:21:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:38,737 INFO L225 Difference]: With dead ends: 3898 [2022-12-14 10:21:38,738 INFO L226 Difference]: Without dead ends: 3322 [2022-12-14 10:21:38,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:21:38,738 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:38,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 17 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2022-12-14 10:21:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2698. [2022-12-14 10:21:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 2697 states have (on average 3.757508342602892) internal successors, (10134), 2697 states have internal predecessors, (10134), 0 states have call successors, (0), 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 10:21:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 10134 transitions. [2022-12-14 10:21:38,803 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 10134 transitions. Word has length 13 [2022-12-14 10:21:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:38,803 INFO L495 AbstractCegarLoop]: Abstraction has 2698 states and 10134 transitions. [2022-12-14 10:21:38,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 10134 transitions. [2022-12-14 10:21:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:21:38,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:38,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:38,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 10:21:38,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:38,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:38,812 INFO L85 PathProgramCache]: Analyzing trace with hash 847594047, now seen corresponding path program 1 times [2022-12-14 10:21:38,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:38,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344667759] [2022-12-14 10:21:38,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:38,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:38,954 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 10:21:38,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:38,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344667759] [2022-12-14 10:21:38,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344667759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:38,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:38,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:21:38,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290096190] [2022-12-14 10:21:38,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:38,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:21:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:38,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:21:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:21:38,956 INFO L87 Difference]: Start difference. First operand 2698 states and 10134 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:39,156 INFO L93 Difference]: Finished difference Result 3670 states and 13164 transitions. [2022-12-14 10:21:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:21:39,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 10:21:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:39,169 INFO L225 Difference]: With dead ends: 3670 [2022-12-14 10:21:39,169 INFO L226 Difference]: Without dead ends: 3194 [2022-12-14 10:21:39,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:21:39,169 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:39,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 15 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-12-14 10:21:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2634. [2022-12-14 10:21:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 3.7394606912267374) internal successors, (9846), 2633 states have internal predecessors, (9846), 0 states have call successors, (0), 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 10:21:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 9846 transitions. [2022-12-14 10:21:39,225 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 9846 transitions. Word has length 14 [2022-12-14 10:21:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:39,225 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 9846 transitions. [2022-12-14 10:21:39,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 9846 transitions. [2022-12-14 10:21:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:21:39,227 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:39,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:39,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 10:21:39,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1940177401, now seen corresponding path program 1 times [2022-12-14 10:21:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:39,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276199625] [2022-12-14 10:21:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:39,368 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 10:21:39,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:39,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276199625] [2022-12-14 10:21:39,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276199625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:39,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:39,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:21:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677202655] [2022-12-14 10:21:39,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:39,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:21:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:39,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:21:39,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:21:39,370 INFO L87 Difference]: Start difference. First operand 2634 states and 9846 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:39,555 INFO L93 Difference]: Finished difference Result 3222 states and 11552 transitions. [2022-12-14 10:21:39,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:21:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 10:21:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:39,564 INFO L225 Difference]: With dead ends: 3222 [2022-12-14 10:21:39,564 INFO L226 Difference]: Without dead ends: 2838 [2022-12-14 10:21:39,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:21:39,565 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:39,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 25 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2022-12-14 10:21:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2250. [2022-12-14 10:21:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2249 states have (on average 3.7092040907069808) internal successors, (8342), 2249 states have internal predecessors, (8342), 0 states have call successors, (0), 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 10:21:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 8342 transitions. [2022-12-14 10:21:39,616 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 8342 transitions. Word has length 15 [2022-12-14 10:21:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:39,616 INFO L495 AbstractCegarLoop]: Abstraction has 2250 states and 8342 transitions. [2022-12-14 10:21:39,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 8342 transitions. [2022-12-14 10:21:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 10:21:39,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:39,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:39,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 10:21:39,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:39,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:39,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1414315865, now seen corresponding path program 1 times [2022-12-14 10:21:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:39,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19879699] [2022-12-14 10:21:39,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:39,749 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 10:21:39,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:39,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19879699] [2022-12-14 10:21:39,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19879699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:39,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:39,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:21:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28851919] [2022-12-14 10:21:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:39,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:21:39,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:21:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:21:39,751 INFO L87 Difference]: Start difference. First operand 2250 states and 8342 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:39,818 INFO L93 Difference]: Finished difference Result 1750 states and 5846 transitions. [2022-12-14 10:21:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:21:39,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 10:21:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:39,825 INFO L225 Difference]: With dead ends: 1750 [2022-12-14 10:21:39,825 INFO L226 Difference]: Without dead ends: 1750 [2022-12-14 10:21:39,825 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 10:21:39,826 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:39,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2022-12-14 10:21:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2022-12-14 10:21:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 3.342481417953116) internal successors, (5846), 1749 states have internal predecessors, (5846), 0 states have call successors, (0), 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 10:21:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 5846 transitions. [2022-12-14 10:21:39,866 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 5846 transitions. Word has length 16 [2022-12-14 10:21:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:39,867 INFO L495 AbstractCegarLoop]: Abstraction has 1750 states and 5846 transitions. [2022-12-14 10:21:39,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 5846 transitions. [2022-12-14 10:21:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:21:39,869 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:39,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:39,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 10:21:39,870 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash 24777689, now seen corresponding path program 1 times [2022-12-14 10:21:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:39,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686373945] [2022-12-14 10:21:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:39,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:40,007 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 10:21:40,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686373945] [2022-12-14 10:21:40,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686373945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:40,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:40,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:21:40,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49449901] [2022-12-14 10:21:40,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:40,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:21:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:21:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:21:40,009 INFO L87 Difference]: Start difference. First operand 1750 states and 5846 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:40,097 INFO L93 Difference]: Finished difference Result 1122 states and 3344 transitions. [2022-12-14 10:21:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:21:40,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 10:21:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:40,101 INFO L225 Difference]: With dead ends: 1122 [2022-12-14 10:21:40,101 INFO L226 Difference]: Without dead ends: 1122 [2022-12-14 10:21:40,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:21:40,101 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:40,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 12 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-12-14 10:21:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1118. [2022-12-14 10:21:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1117 states have (on average 2.9811996418979407) internal successors, (3330), 1117 states have internal predecessors, (3330), 0 states have call successors, (0), 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 10:21:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 3330 transitions. [2022-12-14 10:21:40,119 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 3330 transitions. Word has length 18 [2022-12-14 10:21:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:40,119 INFO L495 AbstractCegarLoop]: Abstraction has 1118 states and 3330 transitions. [2022-12-14 10:21:40,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:21:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 3330 transitions. [2022-12-14 10:21:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:21:40,123 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:40,123 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 10:21:40,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 10:21:40,123 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash -672463306, now seen corresponding path program 1 times [2022-12-14 10:21:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649203843] [2022-12-14 10:21:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:40,268 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 10:21:40,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:40,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649203843] [2022-12-14 10:21:40,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649203843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:40,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:40,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:21:40,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418618431] [2022-12-14 10:21:40,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:40,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:21:40,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:40,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:21:40,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:21:40,270 INFO L87 Difference]: Start difference. First operand 1118 states and 3330 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 10:21:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:40,375 INFO L93 Difference]: Finished difference Result 822 states and 2450 transitions. [2022-12-14 10:21:40,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:21:40,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 10:21:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:40,378 INFO L225 Difference]: With dead ends: 822 [2022-12-14 10:21:40,378 INFO L226 Difference]: Without dead ends: 822 [2022-12-14 10:21:40,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:21:40,379 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:40,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 16 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-12-14 10:21:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 798. [2022-12-14 10:21:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 2.9811794228356336) internal successors, (2376), 797 states have internal predecessors, (2376), 0 states have call successors, (0), 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 10:21:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2376 transitions. [2022-12-14 10:21:40,391 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2376 transitions. Word has length 21 [2022-12-14 10:21:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:40,391 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 2376 transitions. [2022-12-14 10:21:40,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 10:21:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2376 transitions. [2022-12-14 10:21:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:21:40,393 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:40,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:40,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 10:21:40,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:40,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1370476732, now seen corresponding path program 1 times [2022-12-14 10:21:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:40,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169907360] [2022-12-14 10:21:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:40,548 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 10:21:40,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:40,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169907360] [2022-12-14 10:21:40,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169907360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:40,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:40,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:21:40,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41192975] [2022-12-14 10:21:40,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:40,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:21:40,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:40,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:21:40,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:21:40,550 INFO L87 Difference]: Start difference. First operand 798 states and 2376 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 10:21:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:40,689 INFO L93 Difference]: Finished difference Result 1052 states and 3027 transitions. [2022-12-14 10:21:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:21:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-12-14 10:21:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:40,692 INFO L225 Difference]: With dead ends: 1052 [2022-12-14 10:21:40,692 INFO L226 Difference]: Without dead ends: 776 [2022-12-14 10:21:40,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:21:40,693 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:40,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 29 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-12-14 10:21:40,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 772. [2022-12-14 10:21:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 2.845654993514916) internal successors, (2194), 771 states have internal predecessors, (2194), 0 states have call successors, (0), 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 10:21:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2194 transitions. [2022-12-14 10:21:40,707 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2194 transitions. Word has length 24 [2022-12-14 10:21:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:40,707 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 2194 transitions. [2022-12-14 10:21:40,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 10:21:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2194 transitions. [2022-12-14 10:21:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:21:40,708 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:40,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:40,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 10:21:40,709 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:40,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1901036104, now seen corresponding path program 2 times [2022-12-14 10:21:40,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:40,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604129171] [2022-12-14 10:21:40,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:40,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:40,871 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 10:21:40,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:40,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604129171] [2022-12-14 10:21:40,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604129171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:40,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:40,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:21:40,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893365906] [2022-12-14 10:21:40,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:40,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:21:40,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:40,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:21:40,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:21:40,873 INFO L87 Difference]: Start difference. First operand 772 states and 2194 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 10:21:40,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:40,974 INFO L93 Difference]: Finished difference Result 714 states and 2082 transitions. [2022-12-14 10:21:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:21:40,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-12-14 10:21:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:40,976 INFO L225 Difference]: With dead ends: 714 [2022-12-14 10:21:40,976 INFO L226 Difference]: Without dead ends: 414 [2022-12-14 10:21:40,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:21:40,977 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:40,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 14 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-12-14 10:21:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 382. [2022-12-14 10:21:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 2.6929133858267718) internal successors, (1026), 381 states have internal predecessors, (1026), 0 states have call successors, (0), 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 10:21:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1026 transitions. [2022-12-14 10:21:40,985 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1026 transitions. Word has length 24 [2022-12-14 10:21:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:40,986 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 1026 transitions. [2022-12-14 10:21:40,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 10:21:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1026 transitions. [2022-12-14 10:21:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 10:21:40,988 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:40,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:40,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 10:21:40,988 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash -580203557, now seen corresponding path program 1 times [2022-12-14 10:21:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:40,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374287784] [2022-12-14 10:21:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:41,143 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 10:21:41,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:41,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374287784] [2022-12-14 10:21:41,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374287784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:41,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:41,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:21:41,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753586199] [2022-12-14 10:21:41,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:41,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:21:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:41,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:21:41,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:21:41,145 INFO L87 Difference]: Start difference. First operand 382 states and 1026 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 10:21:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:41,249 INFO L93 Difference]: Finished difference Result 472 states and 1240 transitions. [2022-12-14 10:21:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:21:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-12-14 10:21:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:41,250 INFO L225 Difference]: With dead ends: 472 [2022-12-14 10:21:41,250 INFO L226 Difference]: Without dead ends: 161 [2022-12-14 10:21:41,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:21:41,250 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:41,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 25 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-12-14 10:21:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-12-14 10:21:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.26875) internal successors, (363), 160 states have internal predecessors, (363), 0 states have call successors, (0), 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 10:21:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 363 transitions. [2022-12-14 10:21:41,253 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 363 transitions. Word has length 27 [2022-12-14 10:21:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:41,253 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 363 transitions. [2022-12-14 10:21:41,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 10:21:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 363 transitions. [2022-12-14 10:21:41,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 10:21:41,254 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:41,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:41,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 10:21:41,254 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1681125381, now seen corresponding path program 2 times [2022-12-14 10:21:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:41,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860822407] [2022-12-14 10:21:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:21:41,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:41,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860822407] [2022-12-14 10:21:41,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860822407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:41,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:41,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:21:41,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133380478] [2022-12-14 10:21:41,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:41,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:21:41,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:41,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:21:41,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:21:41,394 INFO L87 Difference]: Start difference. First operand 161 states and 363 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 10:21:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:41,457 INFO L93 Difference]: Finished difference Result 224 states and 508 transitions. [2022-12-14 10:21:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:21:41,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-12-14 10:21:41,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:41,458 INFO L225 Difference]: With dead ends: 224 [2022-12-14 10:21:41,458 INFO L226 Difference]: Without dead ends: 87 [2022-12-14 10:21:41,458 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 10:21:41,458 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:41,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-14 10:21:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-12-14 10:21:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.0930232558139537) internal successors, (180), 86 states have internal predecessors, (180), 0 states have call successors, (0), 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 10:21:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 180 transitions. [2022-12-14 10:21:41,460 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 180 transitions. Word has length 27 [2022-12-14 10:21:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:41,460 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 180 transitions. [2022-12-14 10:21:41,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 10:21:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 180 transitions. [2022-12-14 10:21:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 10:21:41,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:41,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:41,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 10:21:41,461 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:41,462 INFO L85 PathProgramCache]: Analyzing trace with hash 483332231, now seen corresponding path program 3 times [2022-12-14 10:21:41,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:41,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633670631] [2022-12-14 10:21:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:21:42,118 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 10:21:42,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:21:42,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633670631] [2022-12-14 10:21:42,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633670631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:21:42,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:21:42,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 10:21:42,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416757071] [2022-12-14 10:21:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:21:42,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 10:21:42,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:21:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 10:21:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:21:42,120 INFO L87 Difference]: Start difference. First operand 87 states and 180 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 10:21:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:21:42,301 INFO L93 Difference]: Finished difference Result 106 states and 215 transitions. [2022-12-14 10:21:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 10:21:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-12-14 10:21:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:21:42,302 INFO L225 Difference]: With dead ends: 106 [2022-12-14 10:21:42,302 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 10:21:42,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:21:42,303 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:21:42,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 39 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:21:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 10:21:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 10:21:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 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 10:21:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 94 transitions. [2022-12-14 10:21:42,304 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 94 transitions. Word has length 27 [2022-12-14 10:21:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:21:42,304 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 94 transitions. [2022-12-14 10:21:42,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 10:21:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2022-12-14 10:21:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 10:21:42,304 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:21:42,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:42,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 10:21:42,305 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 10:21:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:21:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash 511890913, now seen corresponding path program 4 times [2022-12-14 10:21:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:21:42,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475491350] [2022-12-14 10:21:42,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:21:42,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:21:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 10:21:42,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 10:21:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 10:21:42,388 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 10:21:42,388 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 10:21:42,389 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-14 10:21:42,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-14 10:21:42,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-14 10:21:42,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-14 10:21:42,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-14 10:21:42,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-14 10:21:42,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-14 10:21:42,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 10:21:42,393 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:21:42,397 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 10:21:42,397 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 10:21:42,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 10:21:42 BasicIcfg [2022-12-14 10:21:42,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 10:21:42,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 10:21:42,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 10:21:42,447 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 10:21:42,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:21:33" (3/4) ... [2022-12-14 10:21:42,449 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 10:21:42,519 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 10:21:42,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 10:21:42,520 INFO L158 Benchmark]: Toolchain (without parser) took 9895.71ms. Allocated memory was 119.5MB in the beginning and 358.6MB in the end (delta: 239.1MB). Free memory was 66.2MB in the beginning and 267.8MB in the end (delta: -201.6MB). Peak memory consumption was 193.9MB. Max. memory is 16.1GB. [2022-12-14 10:21:42,520 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 119.5MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 10:21:42,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.28ms. Allocated memory was 119.5MB in the beginning and 169.9MB in the end (delta: 50.3MB). Free memory was 65.9MB in the beginning and 120.5MB in the end (delta: -54.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-12-14 10:21:42,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.10ms. Allocated memory is still 169.9MB. Free memory was 120.5MB in the beginning and 117.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:21:42,521 INFO L158 Benchmark]: Boogie Preprocessor took 22.84ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:21:42,521 INFO L158 Benchmark]: RCFGBuilder took 537.12ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 78.6MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-14 10:21:42,521 INFO L158 Benchmark]: TraceAbstraction took 8822.23ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 78.6MB in the beginning and 61.3MB in the end (delta: 17.3MB). Peak memory consumption was 145.1MB. Max. memory is 16.1GB. [2022-12-14 10:21:42,522 INFO L158 Benchmark]: Witness Printer took 72.38ms. Allocated memory was 297.8MB in the beginning and 358.6MB in the end (delta: 60.8MB). Free memory was 61.3MB in the beginning and 267.8MB in the end (delta: -206.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-12-14 10:21:42,524 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.10ms. Allocated memory is still 119.5MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.28ms. Allocated memory was 119.5MB in the beginning and 169.9MB in the end (delta: 50.3MB). Free memory was 65.9MB in the beginning and 120.5MB in the end (delta: -54.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.10ms. Allocated memory is still 169.9MB. Free memory was 120.5MB in the beginning and 117.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.84ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 537.12ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 78.6MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8822.23ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 78.6MB in the beginning and 61.3MB in the end (delta: 17.3MB). Peak memory consumption was 145.1MB. Max. memory is 16.1GB. * Witness Printer took 72.38ms. Allocated memory was 297.8MB in the beginning and 358.6MB in the end (delta: 60.8MB). Free memory was 61.3MB in the beginning and 267.8MB in the end (delta: -206.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 148 PlacesBefore, 46 PlacesAfterwards, 137 TransitionsBefore, 34 TransitionsAfterwards, 3074 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 8005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4441, independent: 4239, independent conditional: 0, independent unconditional: 4239, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2177, independent: 2122, independent conditional: 0, independent unconditional: 2122, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2177, independent: 2091, independent conditional: 0, independent unconditional: 2091, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 230, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4441, independent: 2117, independent conditional: 0, independent unconditional: 2117, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 2177, unknown conditional: 0, unknown unconditional: 2177] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 270, Positive conditional cache size: 0, Positive unconditional cache size: 270, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t357; [L870] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t357, ((void *)0), P0, ((void *)0))=-2, t357={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t358; [L872] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t358, ((void *)0), P1, ((void *)0))=-1, t357={5:0}, t358={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t359; [L874] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t359, ((void *)0), P2, ((void *)0))=0, t357={5:0}, t358={6:0}, t359={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t360; [L876] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t360, ((void *)0), P3, ((void *)0))=1, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L787] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 876]: 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: 874]: 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: 872]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 448 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 448 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1354 IncrementalHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 94 mSDtfsCounter, 1354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3290occurred in iteration=2, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2300 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 1451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 10:21:42,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_355d20c4-cf08-4b65-8f19-ab1663365490/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