./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.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_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/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_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/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_aef49169-e2dd-4ec5-b8f4-20e23af73a05/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 c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --- 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 04:50:14,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:50:14,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:50:14,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:50:14,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:50:14,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:50:14,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:50:14,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:50:14,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:50:14,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:50:14,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:50:14,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:50:14,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:50:14,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:50:14,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:50:14,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:50:14,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:50:14,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:50:14,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:50:14,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:50:14,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:50:14,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:50:14,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:50:14,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:50:14,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:50:14,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:50:14,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:50:14,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:50:14,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:50:14,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:50:14,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:50:14,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:50:14,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:50:14,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:50:14,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:50:14,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:50:14,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:50:14,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:50:14,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:50:14,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:50:14,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:50:14,884 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 04:50:14,898 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:50:14,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:50:14,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:50:14,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:50:14,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:50:14,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:50:14,899 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:50:14,900 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:50:14,900 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:50:14,900 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 04:50:14,900 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:50:14,900 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:50:14,900 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 04:50:14,900 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 04:50:14,901 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:50:14,901 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 04:50:14,901 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 04:50:14,901 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 04:50:14,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:50:14,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 04:50:14,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:50:14,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:50:14,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:50:14,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:50:14,903 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 04:50:14,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:50:14,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 04:50:14,903 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 04:50:14,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 04:50:14,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 04:50:14,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:50:14,904 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_aef49169-e2dd-4ec5-b8f4-20e23af73a05/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_aef49169-e2dd-4ec5-b8f4-20e23af73a05/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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 [2022-12-14 04:50:15,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:50:15,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:50:15,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:50:15,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:50:15,116 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:50:15,117 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2022-12-14 04:50:17,705 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:50:17,932 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:50:17,932 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2022-12-14 04:50:17,944 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/data/d708fd532/2fba5698cad74153a95c2c46596ac5ca/FLAG42cdcbb96 [2022-12-14 04:50:17,959 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/data/d708fd532/2fba5698cad74153a95c2c46596ac5ca [2022-12-14 04:50:17,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:50:17,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:50:17,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:50:17,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:50:17,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:50:17,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:50:17" (1/1) ... [2022-12-14 04:50:17,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ad2d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:17, skipping insertion in model container [2022-12-14 04:50:17,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:50:17" (1/1) ... [2022-12-14 04:50:17,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:50:18,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:50:18,129 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_aef49169-e2dd-4ec5-b8f4-20e23af73a05/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i[949,962] [2022-12-14 04:50:18,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:50:18,272 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:50:18,281 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_aef49169-e2dd-4ec5-b8f4-20e23af73a05/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i[949,962] [2022-12-14 04:50:18,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:50:18,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:50:18,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:50:18,376 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:50:18,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18 WrapperNode [2022-12-14 04:50:18,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:50:18,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:50:18,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:50:18,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:50:18,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,422 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-14 04:50:18,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:50:18,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:50:18,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:50:18,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:50:18,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:50:18,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:50:18,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:50:18,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:50:18,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (1/1) ... [2022-12-14 04:50:18,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:50:18,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:50:18,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:50:18,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:50:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 04:50:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 04:50:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:50:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 04:50:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 04:50:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 04:50:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 04:50:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 04:50:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 04:50:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 04:50:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 04:50:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 04:50:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 04:50:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 04:50:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 04:50:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:50:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:50:18,518 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 04:50:18,637 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:50:18,639 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:50:18,925 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:50:19,000 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:50:19,000 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 04:50:19,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:50:19 BoogieIcfgContainer [2022-12-14 04:50:19,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:50:19,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:50:19,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:50:19,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:50:19,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:50:17" (1/3) ... [2022-12-14 04:50:19,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb261f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:50:19, skipping insertion in model container [2022-12-14 04:50:19,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:50:18" (2/3) ... [2022-12-14 04:50:19,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb261f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:50:19, skipping insertion in model container [2022-12-14 04:50:19,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:50:19" (3/3) ... [2022-12-14 04:50:19,008 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2022-12-14 04:50:19,014 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 04:50:19,022 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:50:19,022 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 04:50:19,022 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 04:50:19,062 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 04:50:19,086 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 04:50:19,097 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 300 flow [2022-12-14 04:50:19,099 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 300 flow [2022-12-14 04:50:19,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-12-14 04:50:19,138 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-12-14 04:50:19,139 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 04:50:19,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-12-14 04:50:19,144 INFO L119 LiptonReduction]: Number of co-enabled transitions 3520 [2022-12-14 04:50:22,527 INFO L134 LiptonReduction]: Checked pairs total: 10325 [2022-12-14 04:50:22,528 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-12-14 04:50:22,535 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2022-12-14 04:50:22,733 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6192 states, 6189 states have (on average 4.212958474713201) internal successors, (26074), 6191 states have internal predecessors, (26074), 0 states have call successors, (0), 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 04:50:22,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 04:50:22,755 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;@77bd24c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 04:50:22,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 04:50:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 6192 states, 6189 states have (on average 4.212958474713201) internal successors, (26074), 6191 states have internal predecessors, (26074), 0 states have call successors, (0), 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 04:50:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 04:50:22,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:22,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 04:50:22,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:22,782 INFO L85 PathProgramCache]: Analyzing trace with hash 552757167, now seen corresponding path program 1 times [2022-12-14 04:50:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:22,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331982385] [2022-12-14 04:50:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:23,125 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 04:50:23,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:23,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331982385] [2022-12-14 04:50:23,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331982385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:23,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:23,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 04:50:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721327192] [2022-12-14 04:50:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:23,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:50:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:50:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:50:23,166 INFO L87 Difference]: Start difference. First operand has 6192 states, 6189 states have (on average 4.212958474713201) internal successors, (26074), 6191 states have internal predecessors, (26074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:23,333 INFO L93 Difference]: Finished difference Result 5042 states and 20104 transitions. [2022-12-14 04:50:23,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:50:23,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 04:50:23,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:23,370 INFO L225 Difference]: With dead ends: 5042 [2022-12-14 04:50:23,370 INFO L226 Difference]: Without dead ends: 4862 [2022-12-14 04:50:23,371 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 04:50:23,373 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:23,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:50:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2022-12-14 04:50:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2022-12-14 04:50:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4862 states, 4861 states have (on average 4.007405883563053) internal successors, (19480), 4861 states have internal predecessors, (19480), 0 states have call successors, (0), 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 04:50:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions. [2022-12-14 04:50:23,640 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 5 [2022-12-14 04:50:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:23,641 INFO L495 AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions. [2022-12-14 04:50:23,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions. [2022-12-14 04:50:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 04:50:23,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:23,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:50:23,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 04:50:23,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash 790192459, now seen corresponding path program 1 times [2022-12-14 04:50:23,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:23,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732198650] [2022-12-14 04:50:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:23,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:24,163 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 04:50:24,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732198650] [2022-12-14 04:50:24,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732198650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:24,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:24,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:50:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140370362] [2022-12-14 04:50:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:24,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:50:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:50:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:50:24,167 INFO L87 Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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 04:50:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:24,452 INFO L93 Difference]: Finished difference Result 5162 states and 20060 transitions. [2022-12-14 04:50:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:50:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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 04:50:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:24,472 INFO L225 Difference]: With dead ends: 5162 [2022-12-14 04:50:24,472 INFO L226 Difference]: Without dead ends: 4262 [2022-12-14 04:50:24,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:50:24,474 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:24,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 28 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:50:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2022-12-14 04:50:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4262. [2022-12-14 04:50:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4262 states, 4261 states have (on average 3.947430180708754) internal successors, (16820), 4261 states have internal predecessors, (16820), 0 states have call successors, (0), 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 04:50:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 16820 transitions. [2022-12-14 04:50:24,637 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 16820 transitions. Word has length 12 [2022-12-14 04:50:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:24,638 INFO L495 AbstractCegarLoop]: Abstraction has 4262 states and 16820 transitions. [2022-12-14 04:50:24,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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 04:50:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 16820 transitions. [2022-12-14 04:50:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 04:50:24,642 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:24,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:50:24,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 04:50:24,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash -834565619, now seen corresponding path program 1 times [2022-12-14 04:50:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:24,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830863040] [2022-12-14 04:50:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:24,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:24,865 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 04:50:24,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:24,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830863040] [2022-12-14 04:50:24,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830863040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:24,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:24,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:50:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430122314] [2022-12-14 04:50:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:24,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:50:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:24,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:50:24,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:50:24,868 INFO L87 Difference]: Start difference. First operand 4262 states and 16820 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 04:50:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:25,062 INFO L93 Difference]: Finished difference Result 4462 states and 17190 transitions. [2022-12-14 04:50:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:50:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 04:50:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:25,091 INFO L225 Difference]: With dead ends: 4462 [2022-12-14 04:50:25,091 INFO L226 Difference]: Without dead ends: 3862 [2022-12-14 04:50:25,092 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 04:50:25,092 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:25,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 26 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:50:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2022-12-14 04:50:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3862. [2022-12-14 04:50:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3861 states have (on average 3.9057239057239057) internal successors, (15080), 3861 states have internal predecessors, (15080), 0 states have call successors, (0), 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 04:50:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 15080 transitions. [2022-12-14 04:50:25,212 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 15080 transitions. Word has length 14 [2022-12-14 04:50:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:25,212 INFO L495 AbstractCegarLoop]: Abstraction has 3862 states and 15080 transitions. [2022-12-14 04:50:25,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 04:50:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 15080 transitions. [2022-12-14 04:50:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 04:50:25,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:25,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:50:25,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 04:50:25,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2038290258, now seen corresponding path program 1 times [2022-12-14 04:50:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:25,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266535177] [2022-12-14 04:50:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:25,834 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 04:50:25,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:25,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266535177] [2022-12-14 04:50:25,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266535177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:25,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:25,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:50:25,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391817320] [2022-12-14 04:50:25,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:25,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:50:25,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:25,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:50:25,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:50:25,837 INFO L87 Difference]: Start difference. First operand 3862 states and 15080 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 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 04:50:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:26,082 INFO L93 Difference]: Finished difference Result 4246 states and 16248 transitions. [2022-12-14 04:50:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:50:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 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 04:50:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:26,098 INFO L225 Difference]: With dead ends: 4246 [2022-12-14 04:50:26,098 INFO L226 Difference]: Without dead ends: 3846 [2022-12-14 04:50:26,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:50:26,099 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:26,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 36 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:50:26,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2022-12-14 04:50:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3846. [2022-12-14 04:50:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3845 states have (on average 3.9011703511053315) internal successors, (15000), 3845 states have internal predecessors, (15000), 0 states have call successors, (0), 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 04:50:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 15000 transitions. [2022-12-14 04:50:26,185 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 15000 transitions. Word has length 16 [2022-12-14 04:50:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:26,185 INFO L495 AbstractCegarLoop]: Abstraction has 3846 states and 15000 transitions. [2022-12-14 04:50:26,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 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 04:50:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 15000 transitions. [2022-12-14 04:50:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 04:50:26,191 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:26,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:50:26,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 04:50:26,191 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1646573732, now seen corresponding path program 1 times [2022-12-14 04:50:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:26,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158449247] [2022-12-14 04:50:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:26,567 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 04:50:26,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:26,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158449247] [2022-12-14 04:50:26,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158449247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:26,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:26,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:50:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958195236] [2022-12-14 04:50:26,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:26,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:50:26,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:50:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:50:26,569 INFO L87 Difference]: Start difference. First operand 3846 states and 15000 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:26,786 INFO L93 Difference]: Finished difference Result 4450 states and 17076 transitions. [2022-12-14 04:50:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:50:26,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 04:50:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:26,803 INFO L225 Difference]: With dead ends: 4450 [2022-12-14 04:50:26,803 INFO L226 Difference]: Without dead ends: 4022 [2022-12-14 04:50:26,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:50:26,804 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:26,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 35 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:50:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2022-12-14 04:50:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 4022. [2022-12-14 04:50:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 4021 states have (on average 3.895548371051977) internal successors, (15664), 4021 states have internal predecessors, (15664), 0 states have call successors, (0), 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 04:50:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 15664 transitions. [2022-12-14 04:50:26,926 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 15664 transitions. Word has length 17 [2022-12-14 04:50:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:26,927 INFO L495 AbstractCegarLoop]: Abstraction has 4022 states and 15664 transitions. [2022-12-14 04:50:26,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 15664 transitions. [2022-12-14 04:50:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 04:50:26,934 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:26,934 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 04:50:26,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 04:50:26,934 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1639151107, now seen corresponding path program 1 times [2022-12-14 04:50:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:26,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290613521] [2022-12-14 04:50:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:27,272 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 04:50:27,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:27,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290613521] [2022-12-14 04:50:27,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290613521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:27,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:27,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:50:27,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582305188] [2022-12-14 04:50:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:27,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:50:27,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:27,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:50:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:50:27,275 INFO L87 Difference]: Start difference. First operand 4022 states and 15664 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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 04:50:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:27,478 INFO L93 Difference]: Finished difference Result 4330 states and 16650 transitions. [2022-12-14 04:50:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:50:27,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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 04:50:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:27,491 INFO L225 Difference]: With dead ends: 4330 [2022-12-14 04:50:27,491 INFO L226 Difference]: Without dead ends: 4078 [2022-12-14 04:50:27,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:50:27,492 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:27,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 40 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:50:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2022-12-14 04:50:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 4078. [2022-12-14 04:50:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4078 states, 4077 states have (on average 3.8955114054451805) internal successors, (15882), 4077 states have internal predecessors, (15882), 0 states have call successors, (0), 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 04:50:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 15882 transitions. [2022-12-14 04:50:27,622 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 15882 transitions. Word has length 18 [2022-12-14 04:50:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:27,622 INFO L495 AbstractCegarLoop]: Abstraction has 4078 states and 15882 transitions. [2022-12-14 04:50:27,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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 04:50:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 15882 transitions. [2022-12-14 04:50:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 04:50:27,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:27,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:50:27,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 04:50:27,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1067811395, now seen corresponding path program 1 times [2022-12-14 04:50:27,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:27,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372862251] [2022-12-14 04:50:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:28,197 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 04:50:28,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:28,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372862251] [2022-12-14 04:50:28,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372862251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:28,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:28,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:50:28,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245961794] [2022-12-14 04:50:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:28,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 04:50:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 04:50:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:50:28,200 INFO L87 Difference]: Start difference. First operand 4078 states and 15882 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:28,579 INFO L93 Difference]: Finished difference Result 4406 states and 16930 transitions. [2022-12-14 04:50:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:50:28,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 04:50:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:28,590 INFO L225 Difference]: With dead ends: 4406 [2022-12-14 04:50:28,590 INFO L226 Difference]: Without dead ends: 4186 [2022-12-14 04:50:28,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 04:50:28,591 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 87 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:28,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 56 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:50:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2022-12-14 04:50:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3926. [2022-12-14 04:50:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 3925 states have (on average 3.8889171974522294) internal successors, (15264), 3925 states have internal predecessors, (15264), 0 states have call successors, (0), 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 04:50:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 15264 transitions. [2022-12-14 04:50:28,667 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 15264 transitions. Word has length 19 [2022-12-14 04:50:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:28,667 INFO L495 AbstractCegarLoop]: Abstraction has 3926 states and 15264 transitions. [2022-12-14 04:50:28,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 15264 transitions. [2022-12-14 04:50:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 04:50:28,672 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:28,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:50:28,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 04:50:28,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 316860945, now seen corresponding path program 1 times [2022-12-14 04:50:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:28,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290600651] [2022-12-14 04:50:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:29,148 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 04:50:29,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:29,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290600651] [2022-12-14 04:50:29,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290600651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:29,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:29,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:50:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448341015] [2022-12-14 04:50:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:29,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 04:50:29,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:29,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 04:50:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:50:29,150 INFO L87 Difference]: Start difference. First operand 3926 states and 15264 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:29,437 INFO L93 Difference]: Finished difference Result 4318 states and 16630 transitions. [2022-12-14 04:50:29,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 04:50:29,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 04:50:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:29,447 INFO L225 Difference]: With dead ends: 4318 [2022-12-14 04:50:29,447 INFO L226 Difference]: Without dead ends: 4102 [2022-12-14 04:50:29,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-14 04:50:29,448 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 94 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:29,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 66 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:50:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2022-12-14 04:50:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4102. [2022-12-14 04:50:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 3.8912460375518165) internal successors, (15958), 4101 states have internal predecessors, (15958), 0 states have call successors, (0), 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 04:50:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 15958 transitions. [2022-12-14 04:50:29,523 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 15958 transitions. Word has length 19 [2022-12-14 04:50:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:29,523 INFO L495 AbstractCegarLoop]: Abstraction has 4102 states and 15958 transitions. [2022-12-14 04:50:29,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 15958 transitions. [2022-12-14 04:50:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 04:50:29,528 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:29,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:50:29,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 04:50:29,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash -100516837, now seen corresponding path program 1 times [2022-12-14 04:50:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:29,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091226399] [2022-12-14 04:50:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:29,612 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 04:50:29,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:29,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091226399] [2022-12-14 04:50:29,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091226399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:29,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:29,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:50:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313070703] [2022-12-14 04:50:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:29,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:50:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:29,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:50:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:50:29,614 INFO L87 Difference]: Start difference. First operand 4102 states and 15958 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:29,681 INFO L93 Difference]: Finished difference Result 3008 states and 10488 transitions. [2022-12-14 04:50:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:50:29,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 04:50:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:29,687 INFO L225 Difference]: With dead ends: 3008 [2022-12-14 04:50:29,687 INFO L226 Difference]: Without dead ends: 3008 [2022-12-14 04:50:29,688 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 04:50:29,688 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:29,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:50:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-12-14 04:50:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2022-12-14 04:50:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 3.487861656135683) internal successors, (10488), 3007 states have internal predecessors, (10488), 0 states have call successors, (0), 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 04:50:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 10488 transitions. [2022-12-14 04:50:29,737 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 10488 transitions. Word has length 19 [2022-12-14 04:50:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:29,738 INFO L495 AbstractCegarLoop]: Abstraction has 3008 states and 10488 transitions. [2022-12-14 04:50:29,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 10488 transitions. [2022-12-14 04:50:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 04:50:29,741 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:29,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:50:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 04:50:29,742 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash -849584707, now seen corresponding path program 1 times [2022-12-14 04:50:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:29,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920913867] [2022-12-14 04:50:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:29,900 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 04:50:29,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:29,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920913867] [2022-12-14 04:50:29,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920913867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:29,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:29,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:50:29,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354775680] [2022-12-14 04:50:29,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:29,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:50:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:29,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:50:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:50:29,902 INFO L87 Difference]: Start difference. First operand 3008 states and 10488 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:29,992 INFO L93 Difference]: Finished difference Result 1878 states and 5968 transitions. [2022-12-14 04:50:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:50:29,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 04:50:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:29,996 INFO L225 Difference]: With dead ends: 1878 [2022-12-14 04:50:29,996 INFO L226 Difference]: Without dead ends: 1878 [2022-12-14 04:50:29,997 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 04:50:29,997 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:29,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:50:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-12-14 04:50:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1738. [2022-12-14 04:50:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 3.153713298791019) internal successors, (5478), 1737 states have internal predecessors, (5478), 0 states have call successors, (0), 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 04:50:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 5478 transitions. [2022-12-14 04:50:30,025 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 5478 transitions. Word has length 20 [2022-12-14 04:50:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:30,025 INFO L495 AbstractCegarLoop]: Abstraction has 1738 states and 5478 transitions. [2022-12-14 04:50:30,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:50:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 5478 transitions. [2022-12-14 04:50:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 04:50:30,028 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:30,028 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] [2022-12-14 04:50:30,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 04:50:30,028 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1082286786, now seen corresponding path program 1 times [2022-12-14 04:50:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:30,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36739184] [2022-12-14 04:50:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:30,194 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 04:50:30,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:30,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36739184] [2022-12-14 04:50:30,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36739184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:30,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:30,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:50:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623785781] [2022-12-14 04:50:30,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:30,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:50:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:30,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:50:30,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:50:30,196 INFO L87 Difference]: Start difference. First operand 1738 states and 5478 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 04:50:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:30,303 INFO L93 Difference]: Finished difference Result 1356 states and 4332 transitions. [2022-12-14 04:50:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:50:30,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-12-14 04:50:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:30,306 INFO L225 Difference]: With dead ends: 1356 [2022-12-14 04:50:30,306 INFO L226 Difference]: Without dead ends: 1356 [2022-12-14 04:50:30,306 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 04:50:30,307 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:30,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 24 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:50:30,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-12-14 04:50:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1328. [2022-12-14 04:50:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 3.2012057272042203) internal successors, (4248), 1327 states have internal predecessors, (4248), 0 states have call successors, (0), 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 04:50:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 4248 transitions. [2022-12-14 04:50:30,326 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 4248 transitions. Word has length 23 [2022-12-14 04:50:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:30,326 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 4248 transitions. [2022-12-14 04:50:30,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 04:50:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 4248 transitions. [2022-12-14 04:50:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 04:50:30,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:30,328 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] [2022-12-14 04:50:30,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 04:50:30,329 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:30,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1231284596, now seen corresponding path program 1 times [2022-12-14 04:50:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:30,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029392056] [2022-12-14 04:50:30,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:30,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:30,616 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 04:50:30,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:30,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029392056] [2022-12-14 04:50:30,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029392056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:30,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:30,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:50:30,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674925564] [2022-12-14 04:50:30,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:30,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:50:30,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:30,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:50:30,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:50:30,618 INFO L87 Difference]: Start difference. First operand 1328 states and 4248 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 04:50:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:30,866 INFO L93 Difference]: Finished difference Result 1752 states and 5488 transitions. [2022-12-14 04:50:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:50:30,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-12-14 04:50:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:30,869 INFO L225 Difference]: With dead ends: 1752 [2022-12-14 04:50:30,869 INFO L226 Difference]: Without dead ends: 1334 [2022-12-14 04:50:30,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:50:30,870 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 71 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:30,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 30 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:50:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-12-14 04:50:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1328. [2022-12-14 04:50:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 3.105501130369254) internal successors, (4121), 1327 states have internal predecessors, (4121), 0 states have call successors, (0), 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 04:50:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 4121 transitions. [2022-12-14 04:50:30,886 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 4121 transitions. Word has length 26 [2022-12-14 04:50:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:30,886 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 4121 transitions. [2022-12-14 04:50:30,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 04:50:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 4121 transitions. [2022-12-14 04:50:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 04:50:30,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:30,888 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] [2022-12-14 04:50:30,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 04:50:30,888 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1576887246, now seen corresponding path program 2 times [2022-12-14 04:50:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:30,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768904323] [2022-12-14 04:50:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:30,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:31,082 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 04:50:31,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:31,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768904323] [2022-12-14 04:50:31,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768904323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:31,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:31,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:50:31,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984591909] [2022-12-14 04:50:31,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:31,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:50:31,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:31,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:50:31,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:50:31,084 INFO L87 Difference]: Start difference. First operand 1328 states and 4121 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 04:50:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:31,184 INFO L93 Difference]: Finished difference Result 1266 states and 3999 transitions. [2022-12-14 04:50:31,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:50:31,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-12-14 04:50:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:31,186 INFO L225 Difference]: With dead ends: 1266 [2022-12-14 04:50:31,187 INFO L226 Difference]: Without dead ends: 891 [2022-12-14 04:50:31,187 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 04:50:31,187 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 23 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 04:50:31,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 23 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:50:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-12-14 04:50:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2022-12-14 04:50:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 3.1168539325842697) internal successors, (2774), 890 states have internal predecessors, (2774), 0 states have call successors, (0), 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 04:50:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 2774 transitions. [2022-12-14 04:50:31,201 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 2774 transitions. Word has length 26 [2022-12-14 04:50:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:31,201 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 2774 transitions. [2022-12-14 04:50:31,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 04:50:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 2774 transitions. [2022-12-14 04:50:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 04:50:31,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:31,204 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, 1, 1, 1] [2022-12-14 04:50:31,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 04:50:31,204 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:31,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1884354441, now seen corresponding path program 1 times [2022-12-14 04:50:31,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:31,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508597940] [2022-12-14 04:50:31,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:31,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:31,513 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 04:50:31,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:31,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508597940] [2022-12-14 04:50:31,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508597940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:31,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:31,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:50:31,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546533161] [2022-12-14 04:50:31,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:31,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:50:31,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:31,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:50:31,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:50:31,515 INFO L87 Difference]: Start difference. First operand 891 states and 2774 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:31,800 INFO L93 Difference]: Finished difference Result 1074 states and 3296 transitions. [2022-12-14 04:50:31,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:50:31,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-12-14 04:50:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:31,801 INFO L225 Difference]: With dead ends: 1074 [2022-12-14 04:50:31,801 INFO L226 Difference]: Without dead ends: 363 [2022-12-14 04:50:31,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:50:31,802 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:31,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:50:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-12-14 04:50:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-12-14 04:50:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.712707182320442) internal successors, (982), 362 states have internal predecessors, (982), 0 states have call successors, (0), 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 04:50:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 982 transitions. [2022-12-14 04:50:31,809 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 982 transitions. Word has length 30 [2022-12-14 04:50:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:31,809 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 982 transitions. [2022-12-14 04:50:31,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 982 transitions. [2022-12-14 04:50:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 04:50:31,810 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:31,810 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, 1, 1, 1] [2022-12-14 04:50:31,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 04:50:31,810 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:31,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash 159957005, now seen corresponding path program 2 times [2022-12-14 04:50:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:31,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609526254] [2022-12-14 04:50:31,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:50:32,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:32,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609526254] [2022-12-14 04:50:32,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609526254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:32,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:32,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:50:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431497056] [2022-12-14 04:50:32,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:32,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 04:50:32,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:32,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 04:50:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:50:32,365 INFO L87 Difference]: Start difference. First operand 363 states and 982 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:32,611 INFO L93 Difference]: Finished difference Result 520 states and 1414 transitions. [2022-12-14 04:50:32,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:50:32,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-12-14 04:50:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:32,612 INFO L225 Difference]: With dead ends: 520 [2022-12-14 04:50:32,613 INFO L226 Difference]: Without dead ends: 477 [2022-12-14 04:50:32,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-14 04:50:32,613 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:32,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 47 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:50:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-12-14 04:50:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 347. [2022-12-14 04:50:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 2.653179190751445) internal successors, (918), 346 states have internal predecessors, (918), 0 states have call successors, (0), 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 04:50:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 918 transitions. [2022-12-14 04:50:32,619 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 918 transitions. Word has length 30 [2022-12-14 04:50:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:32,619 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 918 transitions. [2022-12-14 04:50:32,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 918 transitions. [2022-12-14 04:50:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 04:50:32,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:32,620 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, 1, 1, 1] [2022-12-14 04:50:32,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 04:50:32,620 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1720043447, now seen corresponding path program 3 times [2022-12-14 04:50:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:32,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130935824] [2022-12-14 04:50:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:33,442 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 04:50:33,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:33,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130935824] [2022-12-14 04:50:33,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130935824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:33,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:33,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:50:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721671025] [2022-12-14 04:50:33,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:33,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 04:50:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 04:50:33,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:50:33,445 INFO L87 Difference]: Start difference. First operand 347 states and 918 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:33,628 INFO L93 Difference]: Finished difference Result 440 states and 1158 transitions. [2022-12-14 04:50:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:50:33,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-12-14 04:50:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:33,629 INFO L225 Difference]: With dead ends: 440 [2022-12-14 04:50:33,629 INFO L226 Difference]: Without dead ends: 373 [2022-12-14 04:50:33,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:50:33,630 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:33,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 31 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:50:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-12-14 04:50:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 319. [2022-12-14 04:50:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 2.6226415094339623) internal successors, (834), 318 states have internal predecessors, (834), 0 states have call successors, (0), 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 04:50:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 834 transitions. [2022-12-14 04:50:33,634 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 834 transitions. Word has length 30 [2022-12-14 04:50:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:33,634 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 834 transitions. [2022-12-14 04:50:33,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 834 transitions. [2022-12-14 04:50:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 04:50:33,635 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:33,635 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, 1, 1, 1] [2022-12-14 04:50:33,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 04:50:33,636 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash 508821303, now seen corresponding path program 4 times [2022-12-14 04:50:33,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:33,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195026775] [2022-12-14 04:50:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:34,323 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 04:50:34,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:34,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195026775] [2022-12-14 04:50:34,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195026775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:34,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:34,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 04:50:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613241911] [2022-12-14 04:50:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:34,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 04:50:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 04:50:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:50:34,325 INFO L87 Difference]: Start difference. First operand 319 states and 834 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:34,540 INFO L93 Difference]: Finished difference Result 464 states and 1234 transitions. [2022-12-14 04:50:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 04:50:34,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-12-14 04:50:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:34,542 INFO L225 Difference]: With dead ends: 464 [2022-12-14 04:50:34,542 INFO L226 Difference]: Without dead ends: 417 [2022-12-14 04:50:34,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-14 04:50:34,542 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 80 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:34,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 37 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:50:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-12-14 04:50:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 311. [2022-12-14 04:50:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 2.6129032258064515) internal successors, (810), 310 states have internal predecessors, (810), 0 states have call successors, (0), 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 04:50:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 810 transitions. [2022-12-14 04:50:34,547 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 810 transitions. Word has length 30 [2022-12-14 04:50:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:34,547 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 810 transitions. [2022-12-14 04:50:34,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 810 transitions. [2022-12-14 04:50:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 04:50:34,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:34,548 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, 1, 1, 1] [2022-12-14 04:50:34,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 04:50:34,548 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:34,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:34,549 INFO L85 PathProgramCache]: Analyzing trace with hash 976311109, now seen corresponding path program 5 times [2022-12-14 04:50:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:34,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403716043] [2022-12-14 04:50:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:50:35,462 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 04:50:35,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:50:35,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403716043] [2022-12-14 04:50:35,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403716043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:50:35,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:50:35,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 04:50:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141506102] [2022-12-14 04:50:35,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:50:35,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 04:50:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:35,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 04:50:35,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-14 04:50:35,464 INFO L87 Difference]: Start difference. First operand 311 states and 810 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:50:35,719 INFO L93 Difference]: Finished difference Result 428 states and 1128 transitions. [2022-12-14 04:50:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:50:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-12-14 04:50:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:50:35,720 INFO L225 Difference]: With dead ends: 428 [2022-12-14 04:50:35,720 INFO L226 Difference]: Without dead ends: 335 [2022-12-14 04:50:35,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-14 04:50:35,721 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 86 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:50:35,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 47 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:50:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-12-14 04:50:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 275. [2022-12-14 04:50:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 2.6496350364963503) internal successors, (726), 274 states have internal predecessors, (726), 0 states have call successors, (0), 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 04:50:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 726 transitions. [2022-12-14 04:50:35,725 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 726 transitions. Word has length 30 [2022-12-14 04:50:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:50:35,725 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 726 transitions. [2022-12-14 04:50:35,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:50:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 726 transitions. [2022-12-14 04:50:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 04:50:35,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:50:35,726 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, 1, 1, 1] [2022-12-14 04:50:35,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 04:50:35,726 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 04:50:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:50:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1340140097, now seen corresponding path program 6 times [2022-12-14 04:50:35,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:50:35,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580888166] [2022-12-14 04:50:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:50:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:50:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 04:50:35,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 04:50:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 04:50:35,800 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 04:50:35,800 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 04:50:35,801 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-14 04:50:35,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-14 04:50:35,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-14 04:50:35,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-14 04:50:35,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-14 04:50:35,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-14 04:50:35,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-14 04:50:35,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 04:50:35,805 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:50:35,809 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 04:50:35,809 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 04:50:35,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:50:35 BasicIcfg [2022-12-14 04:50:35,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 04:50:35,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 04:50:35,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 04:50:35,856 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 04:50:35,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:50:19" (3/4) ... [2022-12-14 04:50:35,857 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 04:50:35,927 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 04:50:35,927 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 04:50:35,928 INFO L158 Benchmark]: Toolchain (without parser) took 17965.60ms. Allocated memory was 127.9MB in the beginning and 639.6MB in the end (delta: 511.7MB). Free memory was 100.0MB in the beginning and 333.9MB in the end (delta: -233.9MB). Peak memory consumption was 279.7MB. Max. memory is 16.1GB. [2022-12-14 04:50:35,928 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 04:50:35,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.85ms. Allocated memory is still 127.9MB. Free memory was 99.6MB in the beginning and 71.5MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 04:50:35,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.84ms. Allocated memory is still 127.9MB. Free memory was 71.2MB in the beginning and 68.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 04:50:35,928 INFO L158 Benchmark]: Boogie Preprocessor took 33.82ms. Allocated memory is still 127.9MB. Free memory was 68.7MB in the beginning and 66.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 04:50:35,929 INFO L158 Benchmark]: RCFGBuilder took 544.50ms. Allocated memory is still 127.9MB. Free memory was 66.6MB in the beginning and 79.9MB in the end (delta: -13.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-12-14 04:50:35,929 INFO L158 Benchmark]: TraceAbstraction took 16851.84ms. Allocated memory was 127.9MB in the beginning and 639.6MB in the end (delta: 511.7MB). Free memory was 79.2MB in the beginning and 350.7MB in the end (delta: -271.5MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. [2022-12-14 04:50:35,929 INFO L158 Benchmark]: Witness Printer took 71.40ms. Allocated memory is still 639.6MB. Free memory was 350.7MB in the beginning and 333.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 04:50:35,930 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.14ms. Allocated memory is still 127.9MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.85ms. Allocated memory is still 127.9MB. Free memory was 99.6MB in the beginning and 71.5MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.84ms. Allocated memory is still 127.9MB. Free memory was 71.2MB in the beginning and 68.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.82ms. Allocated memory is still 127.9MB. Free memory was 68.7MB in the beginning and 66.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.50ms. Allocated memory is still 127.9MB. Free memory was 66.6MB in the beginning and 79.9MB in the end (delta: -13.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16851.84ms. Allocated memory was 127.9MB in the beginning and 639.6MB in the end (delta: 511.7MB). Free memory was 79.2MB in the beginning and 350.7MB in the end (delta: -271.5MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. * Witness Printer took 71.40ms. Allocated memory is still 639.6MB. Free memory was 350.7MB in the beginning and 333.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 151 PlacesBefore, 49 PlacesAfterwards, 140 TransitionsBefore, 37 TransitionsAfterwards, 3520 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 10325 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5360, independent: 5112, independent conditional: 0, independent unconditional: 5112, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2500, independent: 2442, independent conditional: 0, independent unconditional: 2442, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2500, independent: 2411, independent conditional: 0, independent unconditional: 2411, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 249, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5360, independent: 2670, independent conditional: 0, independent unconditional: 2670, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 2500, unknown conditional: 0, unknown unconditional: 2500] , Statistics on independence cache: Total cache size (in pairs): 350, Positive cache size: 322, Positive conditional cache size: 0, Positive unconditional cache size: 322, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 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; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-3, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=-2, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t147, ((void *)0), P2, ((void *)0))=-1, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t148, ((void *)0), P3, ((void *)0))=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 861]: 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: 863]: 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: 859]: 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, 178 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1036 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1036 mSDsluCounter, 597 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 415 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2430 IncrementalHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 182 mSDtfsCounter, 2430 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6192occurred in iteration=0, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 784 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 5772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 04:50:35,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aef49169-e2dd-4ec5-b8f4-20e23af73a05/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