./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur --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 dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 --- 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-38b53e6 [2022-11-26 00:32:17,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:32:17,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:32:17,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:32:17,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:32:17,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:32:17,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:32:17,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:32:17,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:32:17,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:32:17,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:32:17,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:32:17,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:32:17,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:32:17,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:32:17,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:32:17,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:32:17,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:32:17,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:32:17,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:32:17,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:32:17,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:32:17,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:32:17,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:32:17,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:32:17,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:32:17,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:32:17,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:32:17,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:32:17,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:32:17,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:32:17,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:32:17,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:32:17,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:32:17,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:32:17,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:32:17,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:32:17,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:32:17,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:32:17,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:32:17,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:32:17,264 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:32:17,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:32:17,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:32:17,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:32:17,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:32:17,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:32:17,292 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:32:17,292 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:32:17,292 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:32:17,293 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:32:17,293 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:32:17,293 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:32:17,294 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:32:17,294 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:32:17,294 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:32:17,294 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:32:17,295 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:32:17,295 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:32:17,295 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:32:17,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:32:17,296 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:32:17,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:32:17,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:32:17,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:32:17,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:32:17,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:32:17,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:32:17,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:32:17,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:32:17,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:32:17,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:32:17,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:32:17,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:32:17,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:32:17,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:32:17,300 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:32:17,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:32:17,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:32:17,301 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:32:17,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:32:17,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:32:17,301 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:32:17,301 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_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/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_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur 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 -> dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 [2022-11-26 00:32:17,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:32:17,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:32:17,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:32:17,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:32:17,595 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:32:17,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-wmm/mix002.opt.i [2022-11-26 00:32:20,683 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:32:21,036 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:32:21,037 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/sv-benchmarks/c/pthread-wmm/mix002.opt.i [2022-11-26 00:32:21,059 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/data/6913a51d5/717c25c0e2a646c89e5d187aad70dc43/FLAG5ccb67fc6 [2022-11-26 00:32:21,078 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/data/6913a51d5/717c25c0e2a646c89e5d187aad70dc43 [2022-11-26 00:32:21,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:32:21,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:32:21,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:32:21,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:32:21,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:32:21,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712333c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21, skipping insertion in model container [2022-11-26 00:32:21,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:32:21,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:32:21,307 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_e02f1e5f-1207-4958-ad83-7e495c0f9679/sv-benchmarks/c/pthread-wmm/mix002.opt.i[944,957] [2022-11-26 00:32:21,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:32:21,512 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:32:21,524 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_e02f1e5f-1207-4958-ad83-7e495c0f9679/sv-benchmarks/c/pthread-wmm/mix002.opt.i[944,957] [2022-11-26 00:32:21,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:32:21,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:32:21,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:32:21,617 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:32:21,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21 WrapperNode [2022-11-26 00:32:21,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:32:21,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:32:21,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:32:21,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:32:21,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,681 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-11-26 00:32:21,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:32:21,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:32:21,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:32:21,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:32:21,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,743 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:32:21,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:32:21,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:32:21,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:32:21,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (1/1) ... [2022-11-26 00:32:21,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:32:21,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:32:21,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:32:21,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:32:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:32:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-26 00:32:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:32:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:32:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:32:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-26 00:32:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-26 00:32:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-26 00:32:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-26 00:32:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-26 00:32:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-26 00:32:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:32:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-26 00:32:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:32:21,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:32:21,859 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 00:32:22,094 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:32:22,096 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:32:22,426 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:32:22,670 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:32:22,676 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:32:22,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:32:22 BoogieIcfgContainer [2022-11-26 00:32:22,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:32:22,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:32:22,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:32:22,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:32:22,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:32:21" (1/3) ... [2022-11-26 00:32:22,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d67c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:32:22, skipping insertion in model container [2022-11-26 00:32:22,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:32:21" (2/3) ... [2022-11-26 00:32:22,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d67c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:32:22, skipping insertion in model container [2022-11-26 00:32:22,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:32:22" (3/3) ... [2022-11-26 00:32:22,698 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2022-11-26 00:32:22,709 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 00:32:22,721 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:32:22,722 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-26 00:32:22,722 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:32:22,832 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-26 00:32:22,883 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:32:22,917 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 259 flow [2022-11-26 00:32:22,920 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 259 flow [2022-11-26 00:32:22,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-11-26 00:32:23,005 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-11-26 00:32:23,005 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-26 00:32:23,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-26 00:32:23,013 INFO L119 LiptonReduction]: Number of co-enabled transitions 2288 [2022-11-26 00:32:28,926 INFO L134 LiptonReduction]: Checked pairs total: 6506 [2022-11-26 00:32:28,927 INFO L136 LiptonReduction]: Total number of compositions: 109 [2022-11-26 00:32:28,935 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2022-11-26 00:32:29,005 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 812 states, 809 states have (on average 3.2138442521631645) internal successors, (2600), 811 states have internal predecessors, (2600), 0 states have call successors, (0), 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-11-26 00:32:29,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:32:29,031 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;@6d9e746c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:32:29,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-26 00:32:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 812 states, 809 states have (on average 3.2138442521631645) internal successors, (2600), 811 states have internal predecessors, (2600), 0 states have call successors, (0), 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-11-26 00:32:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:32:29,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:29,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:29,045 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1324463144, now seen corresponding path program 1 times [2022-11-26 00:32:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:29,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381264481] [2022-11-26 00:32:29,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:29,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:29,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:29,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381264481] [2022-11-26 00:32:29,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381264481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:29,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:29,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:32:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162990044] [2022-11-26 00:32:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:29,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:32:29,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:29,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:32:29,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:29,628 INFO L87 Difference]: Start difference. First operand has 812 states, 809 states have (on average 3.2138442521631645) internal successors, (2600), 811 states have internal predecessors, (2600), 0 states have call successors, (0), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-26 00:32:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:29,774 INFO L93 Difference]: Finished difference Result 687 states and 2125 transitions. [2022-11-26 00:32:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:29,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-26 00:32:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:29,806 INFO L225 Difference]: With dead ends: 687 [2022-11-26 00:32:29,807 INFO L226 Difference]: Without dead ends: 662 [2022-11-26 00:32:29,808 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-11-26 00:32:29,814 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:29,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-11-26 00:32:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2022-11-26 00:32:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 3.1164901664145233) internal successors, (2060), 661 states have internal predecessors, (2060), 0 states have call successors, (0), 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-11-26 00:32:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2022-11-26 00:32:29,935 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 7 [2022-11-26 00:32:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:29,937 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2022-11-26 00:32:29,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-26 00:32:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2022-11-26 00:32:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:32:29,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:29,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:29,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:32:29,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1498709598, now seen corresponding path program 1 times [2022-11-26 00:32:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:29,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570195194] [2022-11-26 00:32:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:30,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:30,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570195194] [2022-11-26 00:32:30,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570195194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:30,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:30,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:32:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38522020] [2022-11-26 00:32:30,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:30,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:32:30,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:30,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:32:30,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:30,231 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:30,307 INFO L93 Difference]: Finished difference Result 654 states and 2028 transitions. [2022-11-26 00:32:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:30,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:32:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:30,314 INFO L225 Difference]: With dead ends: 654 [2022-11-26 00:32:30,314 INFO L226 Difference]: Without dead ends: 654 [2022-11-26 00:32:30,316 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-11-26 00:32:30,317 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:30,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-11-26 00:32:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2022-11-26 00:32:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 3.105666156202144) internal successors, (2028), 653 states have internal predecessors, (2028), 0 states have call successors, (0), 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-11-26 00:32:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 2028 transitions. [2022-11-26 00:32:30,351 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 2028 transitions. Word has length 9 [2022-11-26 00:32:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:30,351 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 2028 transitions. [2022-11-26 00:32:30,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 2028 transitions. [2022-11-26 00:32:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:32:30,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:30,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:30,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:32:30,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:30,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:30,359 INFO L85 PathProgramCache]: Analyzing trace with hash -6600555, now seen corresponding path program 1 times [2022-11-26 00:32:30,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:30,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919797502] [2022-11-26 00:32:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:30,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:30,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919797502] [2022-11-26 00:32:30,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919797502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:30,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:30,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:32:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350729521] [2022-11-26 00:32:30,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:30,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:32:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:30,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:32:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:32:30,668 INFO L87 Difference]: Start difference. First operand 654 states and 2028 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:30,749 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2022-11-26 00:32:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:30,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 00:32:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:30,754 INFO L225 Difference]: With dead ends: 612 [2022-11-26 00:32:30,755 INFO L226 Difference]: Without dead ends: 612 [2022-11-26 00:32:30,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:32:30,757 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:30,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-11-26 00:32:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2022-11-26 00:32:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 3.076923076923077) internal successors, (1880), 611 states have internal predecessors, (1880), 0 states have call successors, (0), 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-11-26 00:32:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2022-11-26 00:32:30,779 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 11 [2022-11-26 00:32:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:30,780 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2022-11-26 00:32:30,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2022-11-26 00:32:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:32:30,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:30,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:30,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:32:30,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1483117992, now seen corresponding path program 1 times [2022-11-26 00:32:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:30,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365256180] [2022-11-26 00:32:30,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:30,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:30,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:30,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365256180] [2022-11-26 00:32:30,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365256180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:30,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:30,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:32:30,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992129076] [2022-11-26 00:32:30,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:30,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:32:30,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:30,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:32:30,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:32:30,981 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:31,070 INFO L93 Difference]: Finished difference Result 572 states and 1738 transitions. [2022-11-26 00:32:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:31,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 00:32:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:31,075 INFO L225 Difference]: With dead ends: 572 [2022-11-26 00:32:31,075 INFO L226 Difference]: Without dead ends: 572 [2022-11-26 00:32:31,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:32:31,076 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:31,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-11-26 00:32:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2022-11-26 00:32:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 3.043782837127846) internal successors, (1738), 571 states have internal predecessors, (1738), 0 states have call successors, (0), 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-11-26 00:32:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1738 transitions. [2022-11-26 00:32:31,098 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1738 transitions. Word has length 11 [2022-11-26 00:32:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:31,098 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 1738 transitions. [2022-11-26 00:32:31,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1738 transitions. [2022-11-26 00:32:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:32:31,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:31,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:31,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:32:31,101 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2085404533, now seen corresponding path program 1 times [2022-11-26 00:32:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:31,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947323860] [2022-11-26 00:32:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:31,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947323860] [2022-11-26 00:32:31,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947323860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:31,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:31,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:32:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9944466] [2022-11-26 00:32:31,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:31,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:32:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:32:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:31,302 INFO L87 Difference]: Start difference. First operand 572 states and 1738 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:31,365 INFO L93 Difference]: Finished difference Result 548 states and 1656 transitions. [2022-11-26 00:32:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:31,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:32:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:31,370 INFO L225 Difference]: With dead ends: 548 [2022-11-26 00:32:31,370 INFO L226 Difference]: Without dead ends: 548 [2022-11-26 00:32:31,370 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-11-26 00:32:31,371 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:31,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-11-26 00:32:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2022-11-26 00:32:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 3.0274223034734917) internal successors, (1656), 547 states have internal predecessors, (1656), 0 states have call successors, (0), 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-11-26 00:32:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1656 transitions. [2022-11-26 00:32:31,392 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1656 transitions. Word has length 13 [2022-11-26 00:32:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:31,393 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 1656 transitions. [2022-11-26 00:32:31,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1656 transitions. [2022-11-26 00:32:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:32:31,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:31,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:31,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:32:31,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -414913717, now seen corresponding path program 1 times [2022-11-26 00:32:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:31,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731506510] [2022-11-26 00:32:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:31,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:31,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731506510] [2022-11-26 00:32:31,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731506510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:31,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:31,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:32:31,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947213313] [2022-11-26 00:32:31,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:31,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:32:31,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:31,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:32:31,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:32:31,623 INFO L87 Difference]: Start difference. First operand 548 states and 1656 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:31,742 INFO L93 Difference]: Finished difference Result 526 states and 1413 transitions. [2022-11-26 00:32:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:32:31,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-26 00:32:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:31,745 INFO L225 Difference]: With dead ends: 526 [2022-11-26 00:32:31,745 INFO L226 Difference]: Without dead ends: 376 [2022-11-26 00:32:31,745 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-11-26 00:32:31,746 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:31,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 20 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-26 00:32:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2022-11-26 00:32:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 2.5813333333333333) internal successors, (968), 375 states have internal predecessors, (968), 0 states have call successors, (0), 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-11-26 00:32:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 968 transitions. [2022-11-26 00:32:31,759 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 968 transitions. Word has length 15 [2022-11-26 00:32:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:31,760 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 968 transitions. [2022-11-26 00:32:31,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 968 transitions. [2022-11-26 00:32:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:32:31,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:31,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:31,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:32:31,762 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:31,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash 784411402, now seen corresponding path program 1 times [2022-11-26 00:32:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:31,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740601129] [2022-11-26 00:32:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:32,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:32,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740601129] [2022-11-26 00:32:32,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740601129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:32,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:32,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:32:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446877787] [2022-11-26 00:32:32,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:32,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:32:32,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:32,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:32:32,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:32:32,153 INFO L87 Difference]: Start difference. First operand 376 states and 968 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:32,303 INFO L93 Difference]: Finished difference Result 318 states and 765 transitions. [2022-11-26 00:32:32,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:32:32,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-26 00:32:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:32,305 INFO L225 Difference]: With dead ends: 318 [2022-11-26 00:32:32,305 INFO L226 Difference]: Without dead ends: 248 [2022-11-26 00:32:32,305 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-11-26 00:32:32,306 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:32,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 28 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-26 00:32:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-11-26 00:32:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.3643724696356276) internal successors, (584), 247 states have internal predecessors, (584), 0 states have call successors, (0), 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-11-26 00:32:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 584 transitions. [2022-11-26 00:32:32,314 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 584 transitions. Word has length 17 [2022-11-26 00:32:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:32,314 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 584 transitions. [2022-11-26 00:32:32,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 584 transitions. [2022-11-26 00:32:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:32:32,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:32,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:32,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:32:32,316 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1884703296, now seen corresponding path program 1 times [2022-11-26 00:32:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:32,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670514883] [2022-11-26 00:32:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:32,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:32,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670514883] [2022-11-26 00:32:32,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670514883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:32,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:32,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:32:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384815978] [2022-11-26 00:32:32,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:32,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:32:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:32,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:32:32,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:32:32,709 INFO L87 Difference]: Start difference. First operand 248 states and 584 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:32,860 INFO L93 Difference]: Finished difference Result 229 states and 544 transitions. [2022-11-26 00:32:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:32:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:32:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:32,862 INFO L225 Difference]: With dead ends: 229 [2022-11-26 00:32:32,862 INFO L226 Difference]: Without dead ends: 215 [2022-11-26 00:32:32,862 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-11-26 00:32:32,863 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:32,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 28 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-26 00:32:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-11-26 00:32:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.4205607476635516) internal successors, (518), 214 states have internal predecessors, (518), 0 states have call successors, (0), 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-11-26 00:32:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions. [2022-11-26 00:32:32,872 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 19 [2022-11-26 00:32:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:32,872 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 518 transitions. [2022-11-26 00:32:32,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions. [2022-11-26 00:32:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:32:32,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:32,874 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] [2022-11-26 00:32:32,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:32:32,874 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash 713108723, now seen corresponding path program 1 times [2022-11-26 00:32:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:32,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106037151] [2022-11-26 00:32:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:32,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:33,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:33,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106037151] [2022-11-26 00:32:33,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106037151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:33,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:33,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:32:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532726981] [2022-11-26 00:32:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:33,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:32:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:33,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:32:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:32:33,257 INFO L87 Difference]: Start difference. First operand 215 states and 518 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-26 00:32:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:33,361 INFO L93 Difference]: Finished difference Result 277 states and 653 transitions. [2022-11-26 00:32:33,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:32:33,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-26 00:32:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:33,363 INFO L225 Difference]: With dead ends: 277 [2022-11-26 00:32:33,363 INFO L226 Difference]: Without dead ends: 107 [2022-11-26 00:32:33,363 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-11-26 00:32:33,364 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:33,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-26 00:32:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-26 00:32:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.0943396226415096) internal successors, (222), 106 states have internal predecessors, (222), 0 states have call successors, (0), 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-11-26 00:32:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 222 transitions. [2022-11-26 00:32:33,367 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 222 transitions. Word has length 22 [2022-11-26 00:32:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:33,368 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 222 transitions. [2022-11-26 00:32:33,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-26 00:32:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 222 transitions. [2022-11-26 00:32:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:32:33,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:33,369 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] [2022-11-26 00:32:33,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:32:33,369 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1594238677, now seen corresponding path program 2 times [2022-11-26 00:32:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:33,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653625931] [2022-11-26 00:32:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:33,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:33,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:33,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653625931] [2022-11-26 00:32:33,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653625931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:33,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:33,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:32:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253710136] [2022-11-26 00:32:33,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:33,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:32:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:33,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:32:33,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:32:33,629 INFO L87 Difference]: Start difference. First operand 107 states and 222 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-26 00:32:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:33,741 INFO L93 Difference]: Finished difference Result 133 states and 270 transitions. [2022-11-26 00:32:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:32:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-26 00:32:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:33,742 INFO L225 Difference]: With dead ends: 133 [2022-11-26 00:32:33,742 INFO L226 Difference]: Without dead ends: 91 [2022-11-26 00:32:33,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-26 00:32:33,743 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:33,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-26 00:32:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2022-11-26 00:32:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.9743589743589745) internal successors, (154), 78 states have internal predecessors, (154), 0 states have call successors, (0), 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-11-26 00:32:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 154 transitions. [2022-11-26 00:32:33,746 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 154 transitions. Word has length 22 [2022-11-26 00:32:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:33,746 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 154 transitions. [2022-11-26 00:32:33,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-26 00:32:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 154 transitions. [2022-11-26 00:32:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:32:33,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:33,749 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] [2022-11-26 00:32:33,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:32:33,750 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:33,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1537231531, now seen corresponding path program 3 times [2022-11-26 00:32:33,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:33,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400997070] [2022-11-26 00:32:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:33,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:33,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400997070] [2022-11-26 00:32:33,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400997070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:33,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:33,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:32:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897675841] [2022-11-26 00:32:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:33,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:32:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:33,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:32:33,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:32:33,977 INFO L87 Difference]: Start difference. First operand 79 states and 154 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-26 00:32:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:34,060 INFO L93 Difference]: Finished difference Result 105 states and 202 transitions. [2022-11-26 00:32:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:32:34,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-26 00:32:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:34,062 INFO L225 Difference]: With dead ends: 105 [2022-11-26 00:32:34,062 INFO L226 Difference]: Without dead ends: 51 [2022-11-26 00:32:34,062 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-11-26 00:32:34,063 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:34,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 11 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-26 00:32:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-26 00:32:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.72) internal successors, (86), 50 states have internal predecessors, (86), 0 states have call successors, (0), 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-11-26 00:32:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2022-11-26 00:32:34,065 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22 [2022-11-26 00:32:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:34,066 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2022-11-26 00:32:34,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-26 00:32:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2022-11-26 00:32:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:32:34,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:34,067 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] [2022-11-26 00:32:34,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:32:34,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash 948395861, now seen corresponding path program 4 times [2022-11-26 00:32:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:34,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314925491] [2022-11-26 00:32:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:35,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:35,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314925491] [2022-11-26 00:32:35,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314925491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:35,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:35,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:32:35,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023778217] [2022-11-26 00:32:35,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:35,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:32:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:35,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:32:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:32:35,618 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-26 00:32:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:35,950 INFO L93 Difference]: Finished difference Result 61 states and 100 transitions. [2022-11-26 00:32:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:32:35,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-26 00:32:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:35,952 INFO L225 Difference]: With dead ends: 61 [2022-11-26 00:32:35,952 INFO L226 Difference]: Without dead ends: 33 [2022-11-26 00:32:35,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:32:35,953 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:35,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-26 00:32:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-26 00:32:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 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-11-26 00:32:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-11-26 00:32:35,955 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 22 [2022-11-26 00:32:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:35,956 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-11-26 00:32:35,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-26 00:32:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-11-26 00:32:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:32:35,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:35,957 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] [2022-11-26 00:32:35,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 00:32:35,958 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-26 00:32:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash 74013909, now seen corresponding path program 5 times [2022-11-26 00:32:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:35,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217948483] [2022-11-26 00:32:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:32:36,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:32:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:32:36,070 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:32:36,070 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:32:36,071 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-26 00:32:36,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-26 00:32:36,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-26 00:32:36,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-26 00:32:36,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-26 00:32:36,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-26 00:32:36,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-26 00:32:36,077 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:36,082 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-26 00:32:36,083 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:32:36,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:32:36 BasicIcfg [2022-11-26 00:32:36,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:32:36,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:32:36,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:32:36,190 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:32:36,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:32:22" (3/4) ... [2022-11-26 00:32:36,192 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-26 00:32:36,326 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:32:36,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:32:36,327 INFO L158 Benchmark]: Toolchain (without parser) took 15245.13ms. Allocated memory was 136.3MB in the beginning and 270.5MB in the end (delta: 134.2MB). Free memory was 104.7MB in the beginning and 220.4MB in the end (delta: -115.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2022-11-26 00:32:36,327 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 136.3MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:32:36,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.47ms. Allocated memory is still 136.3MB. Free memory was 104.3MB in the beginning and 76.6MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-26 00:32:36,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.61ms. Allocated memory is still 136.3MB. Free memory was 76.1MB in the beginning and 73.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:32:36,329 INFO L158 Benchmark]: Boogie Preprocessor took 71.20ms. Allocated memory is still 136.3MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:32:36,332 INFO L158 Benchmark]: RCFGBuilder took 923.01ms. Allocated memory was 136.3MB in the beginning and 186.6MB in the end (delta: 50.3MB). Free memory was 71.6MB in the beginning and 129.7MB in the end (delta: -58.0MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2022-11-26 00:32:36,332 INFO L158 Benchmark]: TraceAbstraction took 13503.42ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 129.7MB in the beginning and 231.9MB in the end (delta: -102.2MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. [2022-11-26 00:32:36,333 INFO L158 Benchmark]: Witness Printer took 136.55ms. Allocated memory is still 270.5MB. Free memory was 231.9MB in the beginning and 220.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-26 00:32:36,335 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.29ms. Allocated memory is still 136.3MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.47ms. Allocated memory is still 136.3MB. Free memory was 104.3MB in the beginning and 76.6MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.61ms. Allocated memory is still 136.3MB. Free memory was 76.1MB in the beginning and 73.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.20ms. Allocated memory is still 136.3MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 923.01ms. Allocated memory was 136.3MB in the beginning and 186.6MB in the end (delta: 50.3MB). Free memory was 71.6MB in the beginning and 129.7MB in the end (delta: -58.0MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13503.42ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 129.7MB in the beginning and 231.9MB in the end (delta: -102.2MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. * Witness Printer took 136.55ms. Allocated memory is still 270.5MB. Free memory was 231.9MB in the beginning and 220.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 130 PlacesBefore, 37 PlacesAfterwards, 122 TransitionsBefore, 28 TransitionsAfterwards, 2288 CoEnabledTransitionPairs, 8 FixpointIterations, 46 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 6506 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3655, independent: 3438, independent conditional: 0, independent unconditional: 3438, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1765, independent: 1698, independent conditional: 0, independent unconditional: 1698, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1765, independent: 1676, independent conditional: 0, independent unconditional: 1676, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 543, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 501, dependent conditional: 0, dependent unconditional: 501, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3655, independent: 1740, independent conditional: 0, independent unconditional: 1740, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 1765, unknown conditional: 0, unknown unconditional: 1765] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-3, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=-2, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=-1, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=50, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=50, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 a = 1 [L756] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L774] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L878] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 786 IncrementalHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 69 mSDtfsCounter, 786 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=812occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-11-26 00:32:36,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e02f1e5f-1207-4958-ad83-7e495c0f9679/bin/utaipan-ByfvJB40ur/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