./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_tso.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_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/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_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/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_3144188a-3661-4c60-93b1-b9c9125c27b7/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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --- 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 07:54:04,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:54:04,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:54:04,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:54:04,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:54:04,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:54:04,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:54:04,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:54:04,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:54:04,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:54:04,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:54:04,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:54:04,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:54:04,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:54:04,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:54:04,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:54:04,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:54:04,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:54:04,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:54:04,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:54:04,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:54:04,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:54:04,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:54:04,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:54:04,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:54:04,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:54:04,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:54:04,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:54:04,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:54:04,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:54:04,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:54:04,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:54:04,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:54:04,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:54:04,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:54:04,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:54:04,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:54:04,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:54:04,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:54:04,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:54:04,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:54:04,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 07:54:04,449 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:54:04,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:54:04,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:54:04,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:54:04,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:54:04,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:54:04,450 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:54:04,451 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:54:04,451 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:54:04,451 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:54:04,451 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:54:04,451 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:54:04,452 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:54:04,452 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:54:04,452 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:54:04,452 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:54:04,452 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:54:04,453 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:54:04,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:54:04,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:54:04,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:54:04,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:54:04,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:54:04,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:54:04,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:54:04,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:54:04,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:54:04,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:54:04,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:54:04,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:54:04,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:54:04,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:54:04,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:54:04,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:54:04,456 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:54:04,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:54:04,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:54:04,457 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:54:04,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:54:04,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:54:04,457 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:54:04,458 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_3144188a-3661-4c60-93b1-b9c9125c27b7/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_3144188a-3661-4c60-93b1-b9c9125c27b7/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 -> ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d [2022-12-14 07:54:04,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:54:04,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:54:04,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:54:04,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:54:04,663 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:54:04,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/mix027_tso.i [2022-12-14 07:54:07,229 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:54:07,436 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:54:07,437 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/sv-benchmarks/c/pthread-wmm/mix027_tso.i [2022-12-14 07:54:07,450 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/data/8e895dad1/1784ffc8408a48cb9687a6e54cdd34ba/FLAG01995d8e2 [2022-12-14 07:54:07,802 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/data/8e895dad1/1784ffc8408a48cb9687a6e54cdd34ba [2022-12-14 07:54:07,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:54:07,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:54:07,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:54:07,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:54:07,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:54:07,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:54:07" (1/1) ... [2022-12-14 07:54:07,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d469312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:07, skipping insertion in model container [2022-12-14 07:54:07,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:54:07" (1/1) ... [2022-12-14 07:54:07,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:54:07,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:54:07,982 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_3144188a-3661-4c60-93b1-b9c9125c27b7/sv-benchmarks/c/pthread-wmm/mix027_tso.i[944,957] [2022-12-14 07:54:08,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:54:08,132 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:54:08,141 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_3144188a-3661-4c60-93b1-b9c9125c27b7/sv-benchmarks/c/pthread-wmm/mix027_tso.i[944,957] [2022-12-14 07:54:08,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 07:54:08,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 07:54:08,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:54:08,201 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:54:08,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08 WrapperNode [2022-12-14 07:54:08,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:54:08,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:54:08,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:54:08,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:54:08,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,235 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-14 07:54:08,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:54:08,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:54:08,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:54:08,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:54:08,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,264 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:54:08,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:54:08,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:54:08,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:54:08,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (1/1) ... [2022-12-14 07:54:08,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:54:08,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:54:08,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:54:08,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:54:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 07:54:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 07:54:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:54:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:54:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:54:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 07:54:08,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 07:54:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 07:54:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 07:54:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 07:54:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 07:54:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 07:54:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 07:54:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:54:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 07:54:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:54:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:54:08,332 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 07:54:08,437 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:54:08,438 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:54:08,696 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:54:08,827 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:54:08,827 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 07:54:08,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:54:08 BoogieIcfgContainer [2022-12-14 07:54:08,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:54:08,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:54:08,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:54:08,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:54:08,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:54:07" (1/3) ... [2022-12-14 07:54:08,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331bf3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:54:08, skipping insertion in model container [2022-12-14 07:54:08,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:08" (2/3) ... [2022-12-14 07:54:08,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331bf3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:54:08, skipping insertion in model container [2022-12-14 07:54:08,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:54:08" (3/3) ... [2022-12-14 07:54:08,835 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2022-12-14 07:54:08,842 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 07:54:08,850 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:54:08,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 07:54:08,850 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 07:54:08,912 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 07:54:08,948 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 07:54:08,960 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 294 flow [2022-12-14 07:54:08,962 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 294 flow [2022-12-14 07:54:08,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-12-14 07:54:09,005 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-14 07:54:09,005 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 07:54:09,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-12-14 07:54:09,012 INFO L119 LiptonReduction]: Number of co-enabled transitions 3390 [2022-12-14 07:54:12,568 INFO L134 LiptonReduction]: Checked pairs total: 9736 [2022-12-14 07:54:12,568 INFO L136 LiptonReduction]: Total number of compositions: 114 [2022-12-14 07:54:12,573 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2022-12-14 07:54:12,721 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5172 states, 5169 states have (on average 4.176436448055717) internal successors, (21588), 5171 states have internal predecessors, (21588), 0 states have call successors, (0), 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 07:54:12,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:54:12,739 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;@2179005d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:54:12,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 07:54:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 5172 states, 5169 states have (on average 4.176436448055717) internal successors, (21588), 5171 states have internal predecessors, (21588), 0 states have call successors, (0), 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 07:54:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 07:54:12,757 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:12,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 07:54:12,758 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 07:54:12,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 544234797, now seen corresponding path program 1 times [2022-12-14 07:54:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:12,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796326505] [2022-12-14 07:54:12,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:12,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:13,036 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 07:54:13,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:13,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796326505] [2022-12-14 07:54:13,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796326505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:13,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:13,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:54:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111255880] [2022-12-14 07:54:13,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:13,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:54:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:13,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:54:13,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:54:13,074 INFO L87 Difference]: Start difference. First operand has 5172 states, 5169 states have (on average 4.176436448055717) internal successors, (21588), 5171 states have internal predecessors, (21588), 0 states have call successors, (0), 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 07:54:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:13,221 INFO L93 Difference]: Finished difference Result 4212 states and 16640 transitions. [2022-12-14 07:54:13,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:54:13,223 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 07:54:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:13,253 INFO L225 Difference]: With dead ends: 4212 [2022-12-14 07:54:13,254 INFO L226 Difference]: Without dead ends: 4062 [2022-12-14 07:54:13,254 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 07:54:13,256 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 10 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 07:54:13,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 10 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:54:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-12-14 07:54:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-12-14 07:54:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 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 07:54:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-12-14 07:54:13,413 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 5 [2022-12-14 07:54:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:13,414 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-12-14 07:54:13,414 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 07:54:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-12-14 07:54:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 07:54:13,416 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:13,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:54:13,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:54:13,416 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 07:54:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash -748801286, now seen corresponding path program 1 times [2022-12-14 07:54:13,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:13,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316223802] [2022-12-14 07:54:13,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:13,636 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 07:54:13,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:13,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316223802] [2022-12-14 07:54:13,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316223802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:13,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:13,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:54:13,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833344924] [2022-12-14 07:54:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:13,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:54:13,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:13,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:54:13,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:54:13,639 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:13,799 INFO L93 Difference]: Finished difference Result 4312 states and 16600 transitions. [2022-12-14 07:54:13,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:54:13,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 07:54:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:13,815 INFO L225 Difference]: With dead ends: 4312 [2022-12-14 07:54:13,815 INFO L226 Difference]: Without dead ends: 3562 [2022-12-14 07:54:13,816 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 07:54:13,816 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:13,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 23 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:54:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2022-12-14 07:54:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3562. [2022-12-14 07:54:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3562 states, 3561 states have (on average 3.9104184217916313) internal successors, (13925), 3561 states have internal predecessors, (13925), 0 states have call successors, (0), 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 07:54:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 13925 transitions. [2022-12-14 07:54:13,959 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 13925 transitions. Word has length 12 [2022-12-14 07:54:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:13,960 INFO L495 AbstractCegarLoop]: Abstraction has 3562 states and 13925 transitions. [2022-12-14 07:54:13,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 13925 transitions. [2022-12-14 07:54:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 07:54:13,965 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:13,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:54:13,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 07:54:13,965 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 07:54:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:13,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1955959005, now seen corresponding path program 1 times [2022-12-14 07:54:13,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:13,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677053694] [2022-12-14 07:54:13,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:13,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:14,279 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 07:54:14,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:14,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677053694] [2022-12-14 07:54:14,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677053694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:14,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:14,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:54:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320588814] [2022-12-14 07:54:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:14,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:54:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:14,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:54:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:54:14,282 INFO L87 Difference]: Start difference. First operand 3562 states and 13925 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:14,471 INFO L93 Difference]: Finished difference Result 3982 states and 15176 transitions. [2022-12-14 07:54:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:54:14,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 07:54:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:14,487 INFO L225 Difference]: With dead ends: 3982 [2022-12-14 07:54:14,487 INFO L226 Difference]: Without dead ends: 3482 [2022-12-14 07:54:14,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:54:14,488 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:14,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 28 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:54:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2022-12-14 07:54:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 3482. [2022-12-14 07:54:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3482 states, 3481 states have (on average 3.895719620798621) internal successors, (13561), 3481 states have internal predecessors, (13561), 0 states have call successors, (0), 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 07:54:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 13561 transitions. [2022-12-14 07:54:14,581 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 13561 transitions. Word has length 14 [2022-12-14 07:54:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:14,581 INFO L495 AbstractCegarLoop]: Abstraction has 3482 states and 13561 transitions. [2022-12-14 07:54:14,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 13561 transitions. [2022-12-14 07:54:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 07:54:14,584 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:14,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:54:14,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 07:54:14,584 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 07:54:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash 712089062, now seen corresponding path program 1 times [2022-12-14 07:54:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:14,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194644810] [2022-12-14 07:54:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:15,078 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 07:54:15,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:15,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194644810] [2022-12-14 07:54:15,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194644810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:15,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:15,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:54:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313712444] [2022-12-14 07:54:15,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:15,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:54:15,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:54:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:54:15,080 INFO L87 Difference]: Start difference. First operand 3482 states and 13561 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:15,300 INFO L93 Difference]: Finished difference Result 4122 states and 15761 transitions. [2022-12-14 07:54:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:54:15,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 07:54:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:15,316 INFO L225 Difference]: With dead ends: 4122 [2022-12-14 07:54:15,316 INFO L226 Difference]: Without dead ends: 3666 [2022-12-14 07:54:15,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:54:15,317 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:15,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 35 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:54:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3666 states. [2022-12-14 07:54:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3666 to 3666. [2022-12-14 07:54:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3665 states have (on average 3.8889495225102317) internal successors, (14253), 3665 states have internal predecessors, (14253), 0 states have call successors, (0), 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 07:54:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 14253 transitions. [2022-12-14 07:54:15,402 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 14253 transitions. Word has length 15 [2022-12-14 07:54:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:15,403 INFO L495 AbstractCegarLoop]: Abstraction has 3666 states and 14253 transitions. [2022-12-14 07:54:15,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 14253 transitions. [2022-12-14 07:54:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 07:54:15,406 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:15,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:54:15,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 07:54:15,406 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 07:54:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1519097415, now seen corresponding path program 1 times [2022-12-14 07:54:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:15,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444562441] [2022-12-14 07:54:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:15,661 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 07:54:15,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:15,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444562441] [2022-12-14 07:54:15,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444562441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:15,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:15,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:54:15,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427489597] [2022-12-14 07:54:15,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:15,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:54:15,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:15,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:54:15,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:54:15,663 INFO L87 Difference]: Start difference. First operand 3666 states and 14253 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:15,878 INFO L93 Difference]: Finished difference Result 4050 states and 15506 transitions. [2022-12-14 07:54:15,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:54:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 07:54:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:15,900 INFO L225 Difference]: With dead ends: 4050 [2022-12-14 07:54:15,900 INFO L226 Difference]: Without dead ends: 3736 [2022-12-14 07:54:15,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:54:15,901 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:15,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 32 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:54:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2022-12-14 07:54:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3696. [2022-12-14 07:54:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 3695 states have (on average 3.8868741542625167) internal successors, (14362), 3695 states have internal predecessors, (14362), 0 states have call successors, (0), 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 07:54:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 14362 transitions. [2022-12-14 07:54:16,009 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 14362 transitions. Word has length 16 [2022-12-14 07:54:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:16,009 INFO L495 AbstractCegarLoop]: Abstraction has 3696 states and 14362 transitions. [2022-12-14 07:54:16,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 14362 transitions. [2022-12-14 07:54:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 07:54:16,014 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:16,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:54:16,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 07:54:16,014 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 07:54:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:16,015 INFO L85 PathProgramCache]: Analyzing trace with hash 592891547, now seen corresponding path program 2 times [2022-12-14 07:54:16,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:16,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106032935] [2022-12-14 07:54:16,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:16,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:16,309 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 07:54:16,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:16,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106032935] [2022-12-14 07:54:16,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106032935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:16,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:16,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:54:16,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030235638] [2022-12-14 07:54:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:16,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:54:16,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:16,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:54:16,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:54:16,310 INFO L87 Difference]: Start difference. First operand 3696 states and 14362 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:16,533 INFO L93 Difference]: Finished difference Result 4056 states and 15507 transitions. [2022-12-14 07:54:16,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:54:16,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 07:54:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:16,548 INFO L225 Difference]: With dead ends: 4056 [2022-12-14 07:54:16,548 INFO L226 Difference]: Without dead ends: 3742 [2022-12-14 07:54:16,548 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 07:54:16,549 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:16,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 41 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:54:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2022-12-14 07:54:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3712. [2022-12-14 07:54:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3711 states have (on average 3.887361897062786) internal successors, (14426), 3711 states have internal predecessors, (14426), 0 states have call successors, (0), 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 07:54:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 14426 transitions. [2022-12-14 07:54:16,627 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 14426 transitions. Word has length 16 [2022-12-14 07:54:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:16,627 INFO L495 AbstractCegarLoop]: Abstraction has 3712 states and 14426 transitions. [2022-12-14 07:54:16,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 14426 transitions. [2022-12-14 07:54:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 07:54:16,631 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:16,631 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 07:54:16,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 07:54:16,632 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 07:54:16,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:16,632 INFO L85 PathProgramCache]: Analyzing trace with hash -646960539, now seen corresponding path program 1 times [2022-12-14 07:54:16,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:16,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076535367] [2022-12-14 07:54:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:16,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:16,788 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 07:54:16,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:16,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076535367] [2022-12-14 07:54:16,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076535367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:16,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:16,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:54:16,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981073439] [2022-12-14 07:54:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:16,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:54:16,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:16,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:54:16,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:54:16,790 INFO L87 Difference]: Start difference. First operand 3712 states and 14426 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 07:54:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:16,924 INFO L93 Difference]: Finished difference Result 3556 states and 12536 transitions. [2022-12-14 07:54:16,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:54:16,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 07:54:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:16,933 INFO L225 Difference]: With dead ends: 3556 [2022-12-14 07:54:16,934 INFO L226 Difference]: Without dead ends: 2716 [2022-12-14 07:54:16,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:54:16,934 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:16,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 25 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:54:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2022-12-14 07:54:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2022-12-14 07:54:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2715 states have (on average 3.4791896869244936) internal successors, (9446), 2715 states have internal predecessors, (9446), 0 states have call successors, (0), 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 07:54:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 9446 transitions. [2022-12-14 07:54:16,997 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 9446 transitions. Word has length 17 [2022-12-14 07:54:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:16,997 INFO L495 AbstractCegarLoop]: Abstraction has 2716 states and 9446 transitions. [2022-12-14 07:54:16,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 07:54:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 9446 transitions. [2022-12-14 07:54:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 07:54:17,001 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:17,001 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 07:54:17,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 07:54:17,002 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 07:54:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash -618488018, now seen corresponding path program 1 times [2022-12-14 07:54:17,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:17,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321906152] [2022-12-14 07:54:17,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:17,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:17,129 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 07:54:17,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:17,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321906152] [2022-12-14 07:54:17,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321906152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:17,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:17,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:54:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304566649] [2022-12-14 07:54:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:17,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:54:17,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:17,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:54:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:54:17,130 INFO L87 Difference]: Start difference. First operand 2716 states and 9446 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 07:54:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:17,271 INFO L93 Difference]: Finished difference Result 2110 states and 6741 transitions. [2022-12-14 07:54:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:54:17,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 07:54:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:17,278 INFO L225 Difference]: With dead ends: 2110 [2022-12-14 07:54:17,279 INFO L226 Difference]: Without dead ends: 1630 [2022-12-14 07:54:17,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:54:17,279 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:17,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:54:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2022-12-14 07:54:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1540. [2022-12-14 07:54:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 3.110461338531514) internal successors, (4787), 1539 states have internal predecessors, (4787), 0 states have call successors, (0), 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 07:54:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 4787 transitions. [2022-12-14 07:54:17,315 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 4787 transitions. Word has length 18 [2022-12-14 07:54:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:17,315 INFO L495 AbstractCegarLoop]: Abstraction has 1540 states and 4787 transitions. [2022-12-14 07:54:17,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 07:54:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 4787 transitions. [2022-12-14 07:54:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 07:54:17,318 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:17,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:54:17,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 07:54:17,318 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 07:54:17,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash -514845202, now seen corresponding path program 1 times [2022-12-14 07:54:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:17,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53459830] [2022-12-14 07:54:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:17,478 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 07:54:17,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:17,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53459830] [2022-12-14 07:54:17,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53459830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:17,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:17,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:54:17,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528679315] [2022-12-14 07:54:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:17,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:54:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:17,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:54:17,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:54:17,480 INFO L87 Difference]: Start difference. First operand 1540 states and 4787 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:17,657 INFO L93 Difference]: Finished difference Result 1281 states and 3973 transitions. [2022-12-14 07:54:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:54:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 07:54:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:17,660 INFO L225 Difference]: With dead ends: 1281 [2022-12-14 07:54:17,660 INFO L226 Difference]: Without dead ends: 1150 [2022-12-14 07:54:17,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:54:17,661 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 97 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:17,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 45 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:54:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-12-14 07:54:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1130. [2022-12-14 07:54:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 3.150575730735164) internal successors, (3557), 1129 states have internal predecessors, (3557), 0 states have call successors, (0), 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 07:54:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3557 transitions. [2022-12-14 07:54:17,679 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3557 transitions. Word has length 21 [2022-12-14 07:54:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:17,679 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 3557 transitions. [2022-12-14 07:54:17,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:54:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3557 transitions. [2022-12-14 07:54:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 07:54:17,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:17,682 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] [2022-12-14 07:54:17,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 07:54:17,682 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 07:54:17,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1812147845, now seen corresponding path program 1 times [2022-12-14 07:54:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:17,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437725570] [2022-12-14 07:54:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:17,820 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 07:54:17,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:17,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437725570] [2022-12-14 07:54:17,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437725570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:17,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:17,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:54:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529727998] [2022-12-14 07:54:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:17,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:54:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:54:17,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:54:17,822 INFO L87 Difference]: Start difference. First operand 1130 states and 3557 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 07:54:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:17,976 INFO L93 Difference]: Finished difference Result 1659 states and 5131 transitions. [2022-12-14 07:54:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:54:17,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-12-14 07:54:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:17,979 INFO L225 Difference]: With dead ends: 1659 [2022-12-14 07:54:17,979 INFO L226 Difference]: Without dead ends: 1136 [2022-12-14 07:54:17,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:54:17,980 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:17,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 37 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:54:17,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-12-14 07:54:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1130. [2022-12-14 07:54:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 3.007085916740478) internal successors, (3395), 1129 states have internal predecessors, (3395), 0 states have call successors, (0), 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 07:54:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3395 transitions. [2022-12-14 07:54:18,006 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3395 transitions. Word has length 25 [2022-12-14 07:54:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:18,006 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 3395 transitions. [2022-12-14 07:54:18,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 07:54:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3395 transitions. [2022-12-14 07:54:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 07:54:18,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:18,009 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] [2022-12-14 07:54:18,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 07:54:18,010 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 07:54:18,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash 591621823, now seen corresponding path program 1 times [2022-12-14 07:54:18,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:18,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217806340] [2022-12-14 07:54:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:18,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:18,515 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 07:54:18,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:18,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217806340] [2022-12-14 07:54:18,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217806340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:18,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:18,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:54:18,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210967008] [2022-12-14 07:54:18,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:18,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 07:54:18,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 07:54:18,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:54:18,516 INFO L87 Difference]: Start difference. First operand 1130 states and 3395 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 07:54:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:18,704 INFO L93 Difference]: Finished difference Result 1636 states and 4749 transitions. [2022-12-14 07:54:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:54:18,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-12-14 07:54:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:18,707 INFO L225 Difference]: With dead ends: 1636 [2022-12-14 07:54:18,707 INFO L226 Difference]: Without dead ends: 1538 [2022-12-14 07:54:18,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:54:18,708 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:18,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:54:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-12-14 07:54:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1250. [2022-12-14 07:54:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 2.947157726180945) internal successors, (3681), 1249 states have internal predecessors, (3681), 0 states have call successors, (0), 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 07:54:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 3681 transitions. [2022-12-14 07:54:18,728 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 3681 transitions. Word has length 25 [2022-12-14 07:54:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:18,728 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 3681 transitions. [2022-12-14 07:54:18,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 07:54:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 3681 transitions. [2022-12-14 07:54:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 07:54:18,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:18,730 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] [2022-12-14 07:54:18,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 07:54:18,730 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 07:54:18,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:18,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2060556471, now seen corresponding path program 2 times [2022-12-14 07:54:18,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:18,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440936232] [2022-12-14 07:54:18,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:18,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:19,459 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 07:54:19,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:19,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440936232] [2022-12-14 07:54:19,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440936232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:19,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:19,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 07:54:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909355072] [2022-12-14 07:54:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:19,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:54:19,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:54:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:54:19,461 INFO L87 Difference]: Start difference. First operand 1250 states and 3681 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 07:54:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:19,680 INFO L93 Difference]: Finished difference Result 1253 states and 3682 transitions. [2022-12-14 07:54:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:54:19,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-12-14 07:54:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:19,683 INFO L225 Difference]: With dead ends: 1253 [2022-12-14 07:54:19,683 INFO L226 Difference]: Without dead ends: 1248 [2022-12-14 07:54:19,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 07:54:19,684 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:19,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 36 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:54:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-12-14 07:54:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2022-12-14 07:54:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 2.9486768243785084) internal successors, (3677), 1247 states have internal predecessors, (3677), 0 states have call successors, (0), 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 07:54:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 3677 transitions. [2022-12-14 07:54:19,699 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 3677 transitions. Word has length 25 [2022-12-14 07:54:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:19,699 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 3677 transitions. [2022-12-14 07:54:19,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 07:54:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 3677 transitions. [2022-12-14 07:54:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 07:54:19,701 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:19,701 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] [2022-12-14 07:54:19,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 07:54:19,701 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 07:54:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1791667181, now seen corresponding path program 2 times [2022-12-14 07:54:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:19,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660193384] [2022-12-14 07:54:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:19,847 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 07:54:19,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:19,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660193384] [2022-12-14 07:54:19,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660193384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:19,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:19,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 07:54:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676180309] [2022-12-14 07:54:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 07:54:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:19,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 07:54:19,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:54:19,849 INFO L87 Difference]: Start difference. First operand 1248 states and 3677 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 07:54:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:19,997 INFO L93 Difference]: Finished difference Result 1196 states and 3573 transitions. [2022-12-14 07:54:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:54:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-12-14 07:54:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:19,999 INFO L225 Difference]: With dead ends: 1196 [2022-12-14 07:54:19,999 INFO L226 Difference]: Without dead ends: 850 [2022-12-14 07:54:19,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:54:19,999 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 110 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:19,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 29 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:54:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-12-14 07:54:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 730. [2022-12-14 07:54:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 3.0027434842249656) internal successors, (2189), 729 states have internal predecessors, (2189), 0 states have call successors, (0), 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 07:54:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 2189 transitions. [2022-12-14 07:54:20,009 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 2189 transitions. Word has length 25 [2022-12-14 07:54:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:20,009 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 2189 transitions. [2022-12-14 07:54:20,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 07:54:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 2189 transitions. [2022-12-14 07:54:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:54:20,010 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:20,010 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] [2022-12-14 07:54:20,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 07:54:20,011 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 07:54:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1395073568, now seen corresponding path program 1 times [2022-12-14 07:54:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:20,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567083591] [2022-12-14 07:54:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:20,733 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 07:54:20,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:20,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567083591] [2022-12-14 07:54:20,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567083591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:20,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:20,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 07:54:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278236768] [2022-12-14 07:54:20,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:20,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 07:54:20,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:20,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 07:54:20,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-14 07:54:20,735 INFO L87 Difference]: Start difference. First operand 730 states and 2189 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 07:54:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:20,954 INFO L93 Difference]: Finished difference Result 985 states and 2900 transitions. [2022-12-14 07:54:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:54:20,955 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-12-14 07:54:20,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:20,957 INFO L225 Difference]: With dead ends: 985 [2022-12-14 07:54:20,957 INFO L226 Difference]: Without dead ends: 838 [2022-12-14 07:54:20,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:54:20,958 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 97 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:20,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 43 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:54:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-12-14 07:54:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 682. [2022-12-14 07:54:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 2.9441997063142438) internal successors, (2005), 681 states have internal predecessors, (2005), 0 states have call successors, (0), 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 07:54:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 2005 transitions. [2022-12-14 07:54:20,971 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 2005 transitions. Word has length 29 [2022-12-14 07:54:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:20,971 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 2005 transitions. [2022-12-14 07:54:20,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 07:54:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 2005 transitions. [2022-12-14 07:54:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:54:20,973 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:20,973 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] [2022-12-14 07:54:20,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 07:54:20,973 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 07:54:20,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash 424247068, now seen corresponding path program 2 times [2022-12-14 07:54:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:20,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043277352] [2022-12-14 07:54:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:54:22,009 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 07:54:22,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:54:22,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043277352] [2022-12-14 07:54:22,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043277352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:54:22,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:54:22,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 07:54:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559177488] [2022-12-14 07:54:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:54:22,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 07:54:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:54:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 07:54:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 07:54:22,010 INFO L87 Difference]: Start difference. First operand 682 states and 2005 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 07:54:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:54:22,312 INFO L93 Difference]: Finished difference Result 1085 states and 3102 transitions. [2022-12-14 07:54:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:54:22,312 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-12-14 07:54:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:54:22,313 INFO L225 Difference]: With dead ends: 1085 [2022-12-14 07:54:22,313 INFO L226 Difference]: Without dead ends: 726 [2022-12-14 07:54:22,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-12-14 07:54:22,314 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 110 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:54:22,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 63 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:54:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-12-14 07:54:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 618. [2022-12-14 07:54:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 2.847649918962723) internal successors, (1757), 617 states have internal predecessors, (1757), 0 states have call successors, (0), 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 07:54:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1757 transitions. [2022-12-14 07:54:22,326 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1757 transitions. Word has length 29 [2022-12-14 07:54:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:54:22,327 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 1757 transitions. [2022-12-14 07:54:22,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 07:54:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1757 transitions. [2022-12-14 07:54:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:54:22,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:54:22,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, 1, 1, 1] [2022-12-14 07:54:22,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 07:54:22,328 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 07:54:22,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:54:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1338902360, now seen corresponding path program 3 times [2022-12-14 07:54:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:54:22,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430855361] [2022-12-14 07:54:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:54:22,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:54:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 07:54:22,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 07:54:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 07:54:22,406 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 07:54:22,406 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 07:54:22,407 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-14 07:54:22,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-14 07:54:22,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-14 07:54:22,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-14 07:54:22,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-14 07:54:22,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-14 07:54:22,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-14 07:54:22,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 07:54:22,410 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:54:22,414 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 07:54:22,414 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 07:54:22,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:54:22 BasicIcfg [2022-12-14 07:54:22,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 07:54:22,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 07:54:22,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 07:54:22,470 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 07:54:22,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:54:08" (3/4) ... [2022-12-14 07:54:22,472 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 07:54:22,526 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 07:54:22,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 07:54:22,527 INFO L158 Benchmark]: Toolchain (without parser) took 14721.85ms. Allocated memory was 163.6MB in the beginning and 610.3MB in the end (delta: 446.7MB). Free memory was 125.3MB in the beginning and 334.7MB in the end (delta: -209.4MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. [2022-12-14 07:54:22,527 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:54:22,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.81ms. Allocated memory is still 163.6MB. Free memory was 124.7MB in the beginning and 96.6MB in the end (delta: 28.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-14 07:54:22,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.99ms. Allocated memory is still 163.6MB. Free memory was 96.6MB in the beginning and 93.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:54:22,528 INFO L158 Benchmark]: Boogie Preprocessor took 32.95ms. Allocated memory is still 163.6MB. Free memory was 93.9MB in the beginning and 91.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:54:22,528 INFO L158 Benchmark]: RCFGBuilder took 559.54ms. Allocated memory is still 163.6MB. Free memory was 91.8MB in the beginning and 54.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-14 07:54:22,528 INFO L158 Benchmark]: TraceAbstraction took 13638.28ms. Allocated memory was 163.6MB in the beginning and 610.3MB in the end (delta: 446.7MB). Free memory was 53.5MB in the beginning and 350.4MB in the end (delta: -296.9MB). Peak memory consumption was 151.6MB. Max. memory is 16.1GB. [2022-12-14 07:54:22,529 INFO L158 Benchmark]: Witness Printer took 56.66ms. Allocated memory is still 610.3MB. Free memory was 350.4MB in the beginning and 334.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 07:54:22,530 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.16ms. Allocated memory is still 163.6MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.81ms. Allocated memory is still 163.6MB. Free memory was 124.7MB in the beginning and 96.6MB in the end (delta: 28.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.99ms. Allocated memory is still 163.6MB. Free memory was 96.6MB in the beginning and 93.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.95ms. Allocated memory is still 163.6MB. Free memory was 93.9MB in the beginning and 91.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 559.54ms. Allocated memory is still 163.6MB. Free memory was 91.8MB in the beginning and 54.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13638.28ms. Allocated memory was 163.6MB in the beginning and 610.3MB in the end (delta: 446.7MB). Free memory was 53.5MB in the beginning and 350.4MB in the end (delta: -296.9MB). Peak memory consumption was 151.6MB. Max. memory is 16.1GB. * Witness Printer took 56.66ms. Allocated memory is still 610.3MB. Free memory was 350.4MB in the beginning and 334.7MB in the end (delta: 15.7MB). 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.6s, 148 PlacesBefore, 48 PlacesAfterwards, 137 TransitionsBefore, 36 TransitionsAfterwards, 3390 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 9736 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4765, independent: 4527, independent conditional: 0, independent unconditional: 4527, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2478, independent: 2410, independent conditional: 0, independent unconditional: 2410, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2478, independent: 2373, independent conditional: 0, independent unconditional: 2373, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 329, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4765, independent: 2117, independent conditional: 0, independent unconditional: 2117, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 2478, unknown conditional: 0, unknown unconditional: 2478] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 293, Positive conditional cache size: 0, Positive unconditional cache size: 293, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-3, t737={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] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=-2, t737={5:0}, t738={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] [L855] 0 pthread_t t739; [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=-1, t737={5:0}, t738={6:0}, t739={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=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] [L857] 0 pthread_t t740; [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L806] 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) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 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 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 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_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=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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, pthread_create(&t740, ((void *)0), P3, ((void *)0))=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={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=1, z=1] [L820] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L826] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L829] 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) [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 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_p3_EAX=2, __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=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L756] 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) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 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 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=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=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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, t737={5:0}, t738={6:0}, t739={7:0}, t740={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=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 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) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 914 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 914 mSDsluCounter, 515 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2270 IncrementalHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 153 mSDtfsCounter, 2270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5172occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 858 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 3029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 07:54:22,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3144188a-3661-4c60-93b1-b9c9125c27b7/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