./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ceec73f9e554c485344f34d2b1865bfa0707ac614302bf3f054f6fb35398f61 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 06:21:41,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:21:41,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:21:41,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:21:41,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:21:41,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:21:41,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:21:41,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:21:41,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:21:41,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:21:41,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:21:41,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:21:41,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:21:41,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:21:41,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:21:41,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:21:41,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:21:41,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:21:41,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:21:41,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:21:41,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:21:41,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:21:41,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:21:41,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:21:41,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:21:41,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:21:41,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:21:41,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:21:41,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:21:41,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:21:41,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:21:41,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:21:41,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:21:41,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:21:41,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:21:41,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:21:41,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:21:41,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:21:41,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:21:41,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:21:41,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:21:41,399 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 06:21:41,421 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:21:41,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:21:41,421 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:21:41,422 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:21:41,422 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:21:41,423 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:21:41,423 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:21:41,423 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:21:41,423 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:21:41,423 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:21:41,424 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:21:41,424 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:21:41,424 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:21:41,424 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:21:41,424 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:21:41,425 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:21:41,425 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:21:41,425 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:21:41,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:21:41,426 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:21:41,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:21:41,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:21:41,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:21:41,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:21:41,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:21:41,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:21:41,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:21:41,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:21:41,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:21:41,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:21:41,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:21:41,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:21:41,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:21:41,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:21:41,429 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:21:41,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:21:41,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:21:41,429 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:21:41,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:21:41,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:21:41,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:21:41,436 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_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ceec73f9e554c485344f34d2b1865bfa0707ac614302bf3f054f6fb35398f61 [2022-12-14 06:21:41,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:21:41,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:21:41,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:21:41,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:21:41,615 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:21:41,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2022-12-14 06:21:44,158 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:21:44,324 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:21:44,324 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2022-12-14 06:21:44,331 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/data/9651e0255/1252776e00a8490ab53c9d2ed4a826a2/FLAGe9f0ae327 [2022-12-14 06:21:44,718 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/data/9651e0255/1252776e00a8490ab53c9d2ed4a826a2 [2022-12-14 06:21:44,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:21:44,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:21:44,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:21:44,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:21:44,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:21:44,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:44,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef6ef67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44, skipping insertion in model container [2022-12-14 06:21:44,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:44,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:21:44,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:21:44,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,910 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_512d685f-d162-4cd9-8783-0e7e9d829c81/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2022-12-14 06:21:44,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:21:44,924 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:21:44,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 06:21:44,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 06:21:44,953 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_512d685f-d162-4cd9-8783-0e7e9d829c81/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2022-12-14 06:21:44,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:21:44,970 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:21:44,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44 WrapperNode [2022-12-14 06:21:44,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:21:44,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:21:44,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:21:44,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:21:44,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:44,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,022 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 319 [2022-12-14 06:21:45,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:21:45,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:21:45,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:21:45,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:21:45,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,053 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:21:45,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:21:45,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:21:45,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:21:45,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (1/1) ... [2022-12-14 06:21:45,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:21:45,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:21:45,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:21:45,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:21:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:21:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 06:21:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 06:21:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 06:21:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 06:21:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 06:21:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 06:21:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 06:21:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 06:21:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 06:21:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-14 06:21:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-14 06:21:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 06:21:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 06:21:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 06:21:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 06:21:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:21:45,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:21:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 06:21:45,125 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 06:21:45,220 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:21:45,221 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:21:45,564 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:21:45,657 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:21:45,657 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 06:21:45,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:21:45 BoogieIcfgContainer [2022-12-14 06:21:45,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:21:45,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:21:45,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:21:45,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:21:45,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:21:44" (1/3) ... [2022-12-14 06:21:45,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5365e1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:21:45, skipping insertion in model container [2022-12-14 06:21:45,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:44" (2/3) ... [2022-12-14 06:21:45,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5365e1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:21:45, skipping insertion in model container [2022-12-14 06:21:45,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:21:45" (3/3) ... [2022-12-14 06:21:45,665 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2022-12-14 06:21:45,670 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 06:21:45,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:21:45,678 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 06:21:45,678 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 06:21:45,734 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-14 06:21:45,758 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 06:21:45,768 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 247 transitions, 526 flow [2022-12-14 06:21:45,770 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 247 transitions, 526 flow [2022-12-14 06:21:45,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 247 transitions, 526 flow [2022-12-14 06:21:45,826 INFO L130 PetriNetUnfolder]: 19/243 cut-off events. [2022-12-14 06:21:45,826 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-14 06:21:45,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 243 events. 19/243 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 204. Up to 2 conditions per place. [2022-12-14 06:21:45,831 INFO L119 LiptonReduction]: Number of co-enabled transitions 2000 [2022-12-14 06:21:54,941 INFO L134 LiptonReduction]: Checked pairs total: 4236 [2022-12-14 06:21:54,941 INFO L136 LiptonReduction]: Total number of compositions: 248 [2022-12-14 06:21:54,948 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 42 transitions, 116 flow [2022-12-14 06:21:54,995 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 854 states, 853 states have (on average 4.173505275498242) internal successors, (3560), 853 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:55,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:21:55,012 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;@cd72b95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:21:55,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-14 06:21:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 854 states, 853 states have (on average 4.173505275498242) internal successors, (3560), 853 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 06:21:55,032 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:55,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:55,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:21:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:55,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1497286122, now seen corresponding path program 1 times [2022-12-14 06:21:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:55,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557973837] [2022-12-14 06:21:55,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:55,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:21:55,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:55,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557973837] [2022-12-14 06:21:55,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557973837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:55,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:55,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:21:55,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313592071] [2022-12-14 06:21:55,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:55,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:21:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:21:55,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:21:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:55,564 INFO L87 Difference]: Start difference. First operand has 854 states, 853 states have (on average 4.173505275498242) internal successors, (3560), 853 states have internal predecessors, (3560), 0 states have call successors, (0), 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 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:55,704 INFO L93 Difference]: Finished difference Result 1194 states and 5024 transitions. [2022-12-14 06:21:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:21:55,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 06:21:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:55,724 INFO L225 Difference]: With dead ends: 1194 [2022-12-14 06:21:55,724 INFO L226 Difference]: Without dead ends: 1194 [2022-12-14 06:21:55,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:55,727 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 62 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:55,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 12 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:21:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2022-12-14 06:21:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1024. [2022-12-14 06:21:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 4.195503421309873) internal successors, (4292), 1023 states have internal predecessors, (4292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 4292 transitions. [2022-12-14 06:21:55,813 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 4292 transitions. Word has length 27 [2022-12-14 06:21:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:55,814 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 4292 transitions. [2022-12-14 06:21:55,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 4292 transitions. [2022-12-14 06:21:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 06:21:55,817 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:55,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:55,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:21:55,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:21:55,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash 502789261, now seen corresponding path program 1 times [2022-12-14 06:21:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:55,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024881358] [2022-12-14 06:21:55,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:55,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:21:55,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:55,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024881358] [2022-12-14 06:21:55,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024881358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:55,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:55,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:21:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633135610] [2022-12-14 06:21:55,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:55,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:21:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:21:55,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:21:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:21:55,928 INFO L87 Difference]: Start difference. First operand 1024 states and 4292 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:56,027 INFO L93 Difference]: Finished difference Result 1287 states and 5199 transitions. [2022-12-14 06:21:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:21:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 06:21:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:56,032 INFO L225 Difference]: With dead ends: 1287 [2022-12-14 06:21:56,032 INFO L226 Difference]: Without dead ends: 1025 [2022-12-14 06:21:56,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:21:56,033 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:56,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:21:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2022-12-14 06:21:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2022-12-14 06:21:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 4.1923828125) internal successors, (4293), 1024 states have internal predecessors, (4293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4293 transitions. [2022-12-14 06:21:56,063 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4293 transitions. Word has length 29 [2022-12-14 06:21:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:56,063 INFO L495 AbstractCegarLoop]: Abstraction has 1025 states and 4293 transitions. [2022-12-14 06:21:56,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4293 transitions. [2022-12-14 06:21:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 06:21:56,066 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:56,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:56,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 06:21:56,066 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:21:56,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -789845532, now seen corresponding path program 1 times [2022-12-14 06:21:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:56,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013643919] [2022-12-14 06:21:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:21:56,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:56,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013643919] [2022-12-14 06:21:56,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013643919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:56,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:56,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:21:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341524695] [2022-12-14 06:21:56,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:56,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:21:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:21:56,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:21:56,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:56,350 INFO L87 Difference]: Start difference. First operand 1025 states and 4293 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:56,593 INFO L93 Difference]: Finished difference Result 1635 states and 6799 transitions. [2022-12-14 06:21:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:21:56,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 06:21:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:56,611 INFO L225 Difference]: With dead ends: 1635 [2022-12-14 06:21:56,611 INFO L226 Difference]: Without dead ends: 1595 [2022-12-14 06:21:56,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:21:56,612 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 77 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:56,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 37 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:21:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-12-14 06:21:56,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1225. [2022-12-14 06:21:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1224 states have (on average 4.258986928104576) internal successors, (5213), 1224 states have internal predecessors, (5213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 5213 transitions. [2022-12-14 06:21:56,669 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 5213 transitions. Word has length 30 [2022-12-14 06:21:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:56,670 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 5213 transitions. [2022-12-14 06:21:56,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 5213 transitions. [2022-12-14 06:21:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 06:21:56,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:56,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:56,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 06:21:56,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:21:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1632084498, now seen corresponding path program 2 times [2022-12-14 06:21:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:56,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488180262] [2022-12-14 06:21:56,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:56,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:21:56,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:56,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488180262] [2022-12-14 06:21:56,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488180262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:56,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:56,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:21:56,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551032476] [2022-12-14 06:21:56,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:56,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:21:56,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:21:56,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:21:56,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:56,927 INFO L87 Difference]: Start difference. First operand 1225 states and 5213 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:57,147 INFO L93 Difference]: Finished difference Result 1915 states and 8023 transitions. [2022-12-14 06:21:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:21:57,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 06:21:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:57,161 INFO L225 Difference]: With dead ends: 1915 [2022-12-14 06:21:57,161 INFO L226 Difference]: Without dead ends: 1915 [2022-12-14 06:21:57,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:21:57,162 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 69 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:57,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 34 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:21:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-12-14 06:21:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1385. [2022-12-14 06:21:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 4.257947976878612) internal successors, (5893), 1384 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 5893 transitions. [2022-12-14 06:21:57,228 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 5893 transitions. Word has length 30 [2022-12-14 06:21:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:57,228 INFO L495 AbstractCegarLoop]: Abstraction has 1385 states and 5893 transitions. [2022-12-14 06:21:57,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 5893 transitions. [2022-12-14 06:21:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 06:21:57,234 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:57,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:57,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 06:21:57,234 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:21:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1313140938, now seen corresponding path program 3 times [2022-12-14 06:21:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:57,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830728000] [2022-12-14 06:21:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:21:57,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:57,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830728000] [2022-12-14 06:21:57,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830728000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:57,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:57,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:21:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010774220] [2022-12-14 06:21:57,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:57,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:21:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:21:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:21:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:57,461 INFO L87 Difference]: Start difference. First operand 1385 states and 5893 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:57,640 INFO L93 Difference]: Finished difference Result 2355 states and 9887 transitions. [2022-12-14 06:21:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:21:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 06:21:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:57,657 INFO L225 Difference]: With dead ends: 2355 [2022-12-14 06:21:57,657 INFO L226 Difference]: Without dead ends: 2355 [2022-12-14 06:21:57,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:21:57,658 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 87 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:57,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 24 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:21:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2022-12-14 06:21:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1545. [2022-12-14 06:21:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 4.257124352331606) internal successors, (6573), 1544 states have internal predecessors, (6573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 6573 transitions. [2022-12-14 06:21:57,734 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 6573 transitions. Word has length 30 [2022-12-14 06:21:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:57,735 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 6573 transitions. [2022-12-14 06:21:57,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 6573 transitions. [2022-12-14 06:21:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 06:21:57,741 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:57,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:57,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 06:21:57,742 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:21:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:57,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1407715608, now seen corresponding path program 4 times [2022-12-14 06:21:57,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:57,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824985505] [2022-12-14 06:21:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:57,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:21:57,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:57,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824985505] [2022-12-14 06:21:57,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824985505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:57,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:57,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:21:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745888365] [2022-12-14 06:21:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:57,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:21:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:21:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:21:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:57,996 INFO L87 Difference]: Start difference. First operand 1545 states and 6573 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:58,135 INFO L93 Difference]: Finished difference Result 1755 states and 7167 transitions. [2022-12-14 06:21:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:21:58,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 06:21:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:58,143 INFO L225 Difference]: With dead ends: 1755 [2022-12-14 06:21:58,143 INFO L226 Difference]: Without dead ends: 1675 [2022-12-14 06:21:58,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:58,144 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:58,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 29 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:21:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-12-14 06:21:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1465. [2022-12-14 06:21:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1464 states have (on average 4.276639344262295) internal successors, (6261), 1464 states have internal predecessors, (6261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 6261 transitions. [2022-12-14 06:21:58,181 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 6261 transitions. Word has length 30 [2022-12-14 06:21:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:58,182 INFO L495 AbstractCegarLoop]: Abstraction has 1465 states and 6261 transitions. [2022-12-14 06:21:58,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 6261 transitions. [2022-12-14 06:21:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 06:21:58,185 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:58,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:58,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 06:21:58,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:21:58,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1392465114, now seen corresponding path program 5 times [2022-12-14 06:21:58,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:58,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811212393] [2022-12-14 06:21:58,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:58,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:21:58,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:58,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811212393] [2022-12-14 06:21:58,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811212393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:58,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:58,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:21:58,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071443427] [2022-12-14 06:21:58,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:58,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:21:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:21:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:21:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:58,388 INFO L87 Difference]: Start difference. First operand 1465 states and 6261 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:58,556 INFO L93 Difference]: Finished difference Result 2285 states and 9377 transitions. [2022-12-14 06:21:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:21:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 06:21:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:58,566 INFO L225 Difference]: With dead ends: 2285 [2022-12-14 06:21:58,566 INFO L226 Difference]: Without dead ends: 2245 [2022-12-14 06:21:58,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:58,567 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 69 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:58,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 26 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:21:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2022-12-14 06:21:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1385. [2022-12-14 06:21:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 4.269508670520231) internal successors, (5909), 1384 states have internal predecessors, (5909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 5909 transitions. [2022-12-14 06:21:58,603 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 5909 transitions. Word has length 30 [2022-12-14 06:21:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:58,604 INFO L495 AbstractCegarLoop]: Abstraction has 1385 states and 5909 transitions. [2022-12-14 06:21:58,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 5909 transitions. [2022-12-14 06:21:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 06:21:58,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:58,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:58,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 06:21:58,607 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:21:58,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1029464916, now seen corresponding path program 6 times [2022-12-14 06:21:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:58,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677430414] [2022-12-14 06:21:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:58,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:21:58,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:58,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677430414] [2022-12-14 06:21:58,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677430414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:58,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:58,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:21:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158999804] [2022-12-14 06:21:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:58,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:21:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:21:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:21:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:58,840 INFO L87 Difference]: Start difference. First operand 1385 states and 5909 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:59,009 INFO L93 Difference]: Finished difference Result 2475 states and 10327 transitions. [2022-12-14 06:21:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:21:59,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 06:21:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:59,020 INFO L225 Difference]: With dead ends: 2475 [2022-12-14 06:21:59,021 INFO L226 Difference]: Without dead ends: 2475 [2022-12-14 06:21:59,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:21:59,021 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 63 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:59,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 34 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:21:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-12-14 06:21:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 1265. [2022-12-14 06:21:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 4.162183544303797) internal successors, (5261), 1264 states have internal predecessors, (5261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 5261 transitions. [2022-12-14 06:21:59,056 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 5261 transitions. Word has length 30 [2022-12-14 06:21:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:59,057 INFO L495 AbstractCegarLoop]: Abstraction has 1265 states and 5261 transitions. [2022-12-14 06:21:59,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:21:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 5261 transitions. [2022-12-14 06:21:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 06:21:59,059 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:59,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:59,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 06:21:59,060 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:21:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2100469786, now seen corresponding path program 1 times [2022-12-14 06:21:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:59,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011539601] [2022-12-14 06:21:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:21:59,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:59,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011539601] [2022-12-14 06:21:59,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011539601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:21:59,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356980108] [2022-12-14 06:21:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:59,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:21:59,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:21:59,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:21:59,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 06:21:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:59,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 06:21:59,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:21:59,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:21:59,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:21:59,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:22:00,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:22:00,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-14 06:22:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:22:00,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:22:00,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:22:00,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 55 [2022-12-14 06:22:00,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 627 treesize of output 595 [2022-12-14 06:22:00,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 595 treesize of output 547 [2022-12-14 06:22:00,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 451 [2022-12-14 06:22:00,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 213 [2022-12-14 06:22:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:22:01,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356980108] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:22:01,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1213792191] [2022-12-14 06:22:01,540 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:22:01,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:22:01,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2022-12-14 06:22:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032480125] [2022-12-14 06:22:01,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:22:01,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 06:22:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:22:01,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 06:22:01,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=357, Unknown=4, NotChecked=0, Total=462 [2022-12-14 06:22:01,544 INFO L87 Difference]: Start difference. First operand 1265 states and 5261 transitions. Second operand has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:06,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:22:08,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:22:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:22:11,004 INFO L93 Difference]: Finished difference Result 5359 states and 22210 transitions. [2022-12-14 06:22:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 06:22:11,005 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 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 32 [2022-12-14 06:22:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:22:11,021 INFO L225 Difference]: With dead ends: 5359 [2022-12-14 06:22:11,021 INFO L226 Difference]: Without dead ends: 4947 [2022-12-14 06:22:11,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=353, Invalid=1277, Unknown=10, NotChecked=0, Total=1640 [2022-12-14 06:22:11,022 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 477 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 44 mSolverCounterUnsat, 49 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 49 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:22:11,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 167 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1327 Invalid, 49 Unknown, 0 Unchecked, 6.2s Time] [2022-12-14 06:22:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2022-12-14 06:22:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 3308. [2022-12-14 06:22:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3307 states have (on average 4.290595706078016) internal successors, (14189), 3307 states have internal predecessors, (14189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 14189 transitions. [2022-12-14 06:22:11,108 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 14189 transitions. Word has length 32 [2022-12-14 06:22:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:22:11,108 INFO L495 AbstractCegarLoop]: Abstraction has 3308 states and 14189 transitions. [2022-12-14 06:22:11,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:22:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 14189 transitions. [2022-12-14 06:22:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 06:22:11,115 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:22:11,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:22:11,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 06:22:11,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:22:11,317 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:22:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:22:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1511582024, now seen corresponding path program 2 times [2022-12-14 06:22:11,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:22:11,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461659078] [2022-12-14 06:22:11,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:22:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:22:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:22:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:22:12,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:22:12,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461659078] [2022-12-14 06:22:12,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461659078] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:22:12,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818405859] [2022-12-14 06:22:12,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:22:12,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:22:12,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:22:12,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:22:12,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 06:22:12,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:22:12,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:22:12,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 06:22:12,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:22:12,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 06:22:12,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:22:12,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:22:12,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:22:12,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:22:12,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:22:12,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 06:22:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:22:12,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:22:13,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:22:13,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2022-12-14 06:22:13,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2837 treesize of output 2765 [2022-12-14 06:22:13,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1451 treesize of output 1343 [2022-12-14 06:22:13,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2657 treesize of output 2441 [2022-12-14 06:22:13,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2342 treesize of output 1958 [2022-12-14 06:22:13,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2010 treesize of output 1956 [2022-12-14 06:23:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:23:16,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818405859] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:23:16,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1148418071] [2022-12-14 06:23:16,269 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:23:16,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:23:16,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2022-12-14 06:23:16,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409530131] [2022-12-14 06:23:16,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:23:16,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 06:23:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:23:16,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 06:23:16,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=503, Unknown=11, NotChecked=0, Total=600 [2022-12-14 06:23:16,271 INFO L87 Difference]: Start difference. First operand 3308 states and 14189 transitions. Second operand has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:18,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:23:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:23:19,982 INFO L93 Difference]: Finished difference Result 5403 states and 23024 transitions. [2022-12-14 06:23:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 06:23:19,983 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 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 32 [2022-12-14 06:23:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:23:19,998 INFO L225 Difference]: With dead ends: 5403 [2022-12-14 06:23:19,998 INFO L226 Difference]: Without dead ends: 4889 [2022-12-14 06:23:19,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=821, Unknown=16, NotChecked=0, Total=992 [2022-12-14 06:23:19,999 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 327 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 35 mSolverCounterUnsat, 85 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 85 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:23:19,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 150 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1098 Invalid, 85 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 06:23:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2022-12-14 06:23:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 2458. [2022-12-14 06:23:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 2457 states have (on average 4.172975172975173) internal successors, (10253), 2457 states have internal predecessors, (10253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 10253 transitions. [2022-12-14 06:23:20,065 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 10253 transitions. Word has length 32 [2022-12-14 06:23:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:23:20,065 INFO L495 AbstractCegarLoop]: Abstraction has 2458 states and 10253 transitions. [2022-12-14 06:23:20,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 10253 transitions. [2022-12-14 06:23:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:23:20,070 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:23:20,070 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:23:20,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 06:23:20,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 06:23:20,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:23:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:23:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash 560654659, now seen corresponding path program 3 times [2022-12-14 06:23:20,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:23:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050141754] [2022-12-14 06:23:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:23:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:23:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:23:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:23:20,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:23:20,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050141754] [2022-12-14 06:23:20,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050141754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:23:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407847991] [2022-12-14 06:23:20,949 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:23:20,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:23:20,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:23:20,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:23:20,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 06:23:21,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:23:21,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:23:21,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 06:23:21,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:23:21,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-14 06:23:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:23:21,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:23:21,606 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-14 06:23:21,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-14 06:23:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:23:21,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407847991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:23:21,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [319596740] [2022-12-14 06:23:21,786 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:23:21,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:23:21,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 19 [2022-12-14 06:23:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123487757] [2022-12-14 06:23:21,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:23:21,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 06:23:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:23:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 06:23:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-12-14 06:23:21,788 INFO L87 Difference]: Start difference. First operand 2458 states and 10253 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:23:25,239 INFO L93 Difference]: Finished difference Result 20623 states and 84682 transitions. [2022-12-14 06:23:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-14 06:23:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 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 33 [2022-12-14 06:23:25,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:23:25,302 INFO L225 Difference]: With dead ends: 20623 [2022-12-14 06:23:25,302 INFO L226 Difference]: Without dead ends: 20290 [2022-12-14 06:23:25,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=957, Invalid=4593, Unknown=0, NotChecked=0, Total=5550 [2022-12-14 06:23:25,303 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1169 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:23:25,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 305 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1926 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 06:23:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20290 states. [2022-12-14 06:23:25,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20290 to 3732. [2022-12-14 06:23:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3732 states, 3731 states have (on average 4.297775395336371) internal successors, (16035), 3731 states have internal predecessors, (16035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 16035 transitions. [2022-12-14 06:23:25,538 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 16035 transitions. Word has length 33 [2022-12-14 06:23:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:23:25,538 INFO L495 AbstractCegarLoop]: Abstraction has 3732 states and 16035 transitions. [2022-12-14 06:23:25,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 16035 transitions. [2022-12-14 06:23:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:23:25,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:23:25,546 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:23:25,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 06:23:25,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:23:25,747 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:23:25,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:23:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash -795558735, now seen corresponding path program 4 times [2022-12-14 06:23:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:23:25,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942134267] [2022-12-14 06:23:25,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:23:25,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:23:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:23:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:23:27,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:23:27,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942134267] [2022-12-14 06:23:27,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942134267] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:23:27,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160051736] [2022-12-14 06:23:27,152 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:23:27,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:23:27,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:23:27,153 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:23:27,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 06:23:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:23:27,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 06:23:27,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:23:27,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:23:27,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:23:27,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-14 06:23:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:23:27,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:23:27,862 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-14 06:23:27,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 34 [2022-12-14 06:23:27,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-12-14 06:23:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:23:27,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160051736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:23:27,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1601481103] [2022-12-14 06:23:27,981 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:23:27,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:23:27,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 26 [2022-12-14 06:23:27,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720311928] [2022-12-14 06:23:27,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:23:27,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 06:23:27,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:23:27,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 06:23:27,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=651, Unknown=2, NotChecked=0, Total=756 [2022-12-14 06:23:27,983 INFO L87 Difference]: Start difference. First operand 3732 states and 16035 transitions. Second operand has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:23:32,554 INFO L93 Difference]: Finished difference Result 21604 states and 90832 transitions. [2022-12-14 06:23:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-14 06:23:32,554 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 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 33 [2022-12-14 06:23:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:23:32,633 INFO L225 Difference]: With dead ends: 21604 [2022-12-14 06:23:32,633 INFO L226 Difference]: Without dead ends: 21345 [2022-12-14 06:23:32,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1705 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=950, Invalid=5209, Unknown=3, NotChecked=0, Total=6162 [2022-12-14 06:23:32,635 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1130 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 92 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:23:32,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 374 Invalid, 2670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2561 Invalid, 17 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 06:23:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21345 states. [2022-12-14 06:23:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21345 to 5872. [2022-12-14 06:23:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5872 states, 5871 states have (on average 4.406063702946687) internal successors, (25868), 5871 states have internal predecessors, (25868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 25868 transitions. [2022-12-14 06:23:32,864 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 25868 transitions. Word has length 33 [2022-12-14 06:23:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:23:32,864 INFO L495 AbstractCegarLoop]: Abstraction has 5872 states and 25868 transitions. [2022-12-14 06:23:32,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 25868 transitions. [2022-12-14 06:23:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:23:32,875 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:23:32,875 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:23:32,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 06:23:33,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:23:33,076 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:23:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:23:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash -668964367, now seen corresponding path program 5 times [2022-12-14 06:23:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:23:33,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966850824] [2022-12-14 06:23:33,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:23:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:23:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:23:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:23:34,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:23:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966850824] [2022-12-14 06:23:34,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966850824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:23:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081927402] [2022-12-14 06:23:34,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:23:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:23:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:23:34,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:23:34,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 06:23:34,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:23:34,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:23:34,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 06:23:34,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:23:34,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 183 [2022-12-14 06:23:34,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-14 06:23:34,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-14 06:23:34,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-14 06:23:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:23:34,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:23:35,276 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-14 06:23:35,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 154 [2022-12-14 06:23:35,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 122 [2022-12-14 06:23:35,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2022-12-14 06:23:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:23:35,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081927402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:23:35,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [596152057] [2022-12-14 06:23:35,422 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:23:35,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:23:35,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 26 [2022-12-14 06:23:35,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539550935] [2022-12-14 06:23:35,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:23:35,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 06:23:35,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:23:35,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 06:23:35,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2022-12-14 06:23:35,424 INFO L87 Difference]: Start difference. First operand 5872 states and 25868 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:23:44,340 INFO L93 Difference]: Finished difference Result 23641 states and 101596 transitions. [2022-12-14 06:23:44,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-14 06:23:44,340 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 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 33 [2022-12-14 06:23:44,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:23:44,430 INFO L225 Difference]: With dead ends: 23641 [2022-12-14 06:23:44,431 INFO L226 Difference]: Without dead ends: 23472 [2022-12-14 06:23:44,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=781, Invalid=4189, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 06:23:44,432 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 845 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 74 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:23:44,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 403 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2805 Invalid, 2 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 06:23:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23472 states. [2022-12-14 06:23:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23472 to 6114. [2022-12-14 06:23:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6114 states, 6113 states have (on average 4.406510714869949) internal successors, (26937), 6113 states have internal predecessors, (26937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6114 states to 6114 states and 26937 transitions. [2022-12-14 06:23:44,700 INFO L78 Accepts]: Start accepts. Automaton has 6114 states and 26937 transitions. Word has length 33 [2022-12-14 06:23:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:23:44,700 INFO L495 AbstractCegarLoop]: Abstraction has 6114 states and 26937 transitions. [2022-12-14 06:23:44,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6114 states and 26937 transitions. [2022-12-14 06:23:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:23:44,711 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:23:44,711 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:23:44,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 06:23:44,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 06:23:44,912 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:23:44,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:23:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1221300423, now seen corresponding path program 6 times [2022-12-14 06:23:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:23:44,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193795605] [2022-12-14 06:23:44,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:23:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:23:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:23:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:23:45,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:23:45,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193795605] [2022-12-14 06:23:45,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193795605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:23:45,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31819423] [2022-12-14 06:23:45,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:23:45,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:23:45,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:23:45,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:23:45,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 06:23:45,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:23:45,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:23:45,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 06:23:45,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:23:46,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:23:46,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:23:46,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:23:46,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:23:46,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-14 06:23:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:23:46,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:23:46,769 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-14 06:23:46,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 76 [2022-12-14 06:23:46,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2022-12-14 06:23:46,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-12-14 06:23:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:23:47,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31819423] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:23:47,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1892905053] [2022-12-14 06:23:47,018 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:23:47,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:23:47,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2022-12-14 06:23:47,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017327812] [2022-12-14 06:23:47,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:23:47,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 06:23:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:23:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 06:23:47,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2022-12-14 06:23:47,020 INFO L87 Difference]: Start difference. First operand 6114 states and 26937 transitions. Second operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:23:52,727 INFO L93 Difference]: Finished difference Result 26703 states and 115309 transitions. [2022-12-14 06:23:52,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-14 06:23:52,727 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 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 33 [2022-12-14 06:23:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:23:52,808 INFO L225 Difference]: With dead ends: 26703 [2022-12-14 06:23:52,808 INFO L226 Difference]: Without dead ends: 26481 [2022-12-14 06:23:52,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=864, Invalid=5456, Unknown=0, NotChecked=0, Total=6320 [2022-12-14 06:23:52,810 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 935 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 69 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2992 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:23:52,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 441 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2992 Invalid, 7 Unknown, 0 Unchecked, 2.4s Time] [2022-12-14 06:23:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26481 states. [2022-12-14 06:23:53,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26481 to 6510. [2022-12-14 06:23:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 4.396220617606391) internal successors, (28615), 6509 states have internal predecessors, (28615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 28615 transitions. [2022-12-14 06:23:53,115 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 28615 transitions. Word has length 33 [2022-12-14 06:23:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:23:53,115 INFO L495 AbstractCegarLoop]: Abstraction has 6510 states and 28615 transitions. [2022-12-14 06:23:53,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:23:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 28615 transitions. [2022-12-14 06:23:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:23:53,128 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:23:53,128 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:23:53,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 06:23:53,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:23:53,330 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:23:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:23:53,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1094706055, now seen corresponding path program 7 times [2022-12-14 06:23:53,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:23:53,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141823181] [2022-12-14 06:23:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:23:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:23:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:23:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:23:54,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:23:54,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141823181] [2022-12-14 06:23:54,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141823181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:23:54,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626125677] [2022-12-14 06:23:54,246 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:23:54,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:23:54,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:23:54,247 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:23:54,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 06:23:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:23:54,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 06:23:54,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:23:54,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:23:54,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-14 06:23:54,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:23:54,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-14 06:23:54,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:23:54,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-14 06:23:54,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-14 06:23:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:23:54,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:23:55,402 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-14 06:23:55,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 160 [2022-12-14 06:23:55,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2022-12-14 06:23:55,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-12-14 06:23:55,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2022-12-14 06:23:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:23:55,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626125677] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:23:55,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1213122887] [2022-12-14 06:23:55,651 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:23:55,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:23:55,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2022-12-14 06:23:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104172932] [2022-12-14 06:23:55,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:23:55,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 06:23:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:23:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 06:23:55,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=736, Unknown=8, NotChecked=0, Total=870 [2022-12-14 06:23:55,653 INFO L87 Difference]: Start difference. First operand 6510 states and 28615 transitions. Second operand has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:07,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:24:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:24:08,853 INFO L93 Difference]: Finished difference Result 22796 states and 98016 transitions. [2022-12-14 06:24:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 06:24:08,854 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 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 33 [2022-12-14 06:24:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:24:08,919 INFO L225 Difference]: With dead ends: 22796 [2022-12-14 06:24:08,920 INFO L226 Difference]: Without dead ends: 22590 [2022-12-14 06:24:08,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=833, Invalid=4261, Unknown=18, NotChecked=0, Total=5112 [2022-12-14 06:24:08,921 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1609 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 165 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:24:08,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 387 Invalid, 2793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 2612 Invalid, 16 Unknown, 0 Unchecked, 5.5s Time] [2022-12-14 06:24:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22590 states. [2022-12-14 06:24:09,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22590 to 5418. [2022-12-14 06:24:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5418 states, 5417 states have (on average 4.41572826287613) internal successors, (23920), 5417 states have internal predecessors, (23920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5418 states to 5418 states and 23920 transitions. [2022-12-14 06:24:09,188 INFO L78 Accepts]: Start accepts. Automaton has 5418 states and 23920 transitions. Word has length 33 [2022-12-14 06:24:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:24:09,188 INFO L495 AbstractCegarLoop]: Abstraction has 5418 states and 23920 transitions. [2022-12-14 06:24:09,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5418 states and 23920 transitions. [2022-12-14 06:24:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 06:24:09,199 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:24:09,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:24:09,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 06:24:09,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 06:24:09,399 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:24:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:24:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1308438772, now seen corresponding path program 1 times [2022-12-14 06:24:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:24:09,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436230223] [2022-12-14 06:24:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:24:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:24:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:24:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:24:09,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:24:09,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436230223] [2022-12-14 06:24:09,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436230223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:24:09,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:24:09,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:24:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650938175] [2022-12-14 06:24:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:24:09,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:24:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:24:09,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:24:09,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:24:09,506 INFO L87 Difference]: Start difference. First operand 5418 states and 23920 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:24:09,708 INFO L93 Difference]: Finished difference Result 8901 states and 37144 transitions. [2022-12-14 06:24:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:24:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-12-14 06:24:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:24:09,731 INFO L225 Difference]: With dead ends: 8901 [2022-12-14 06:24:09,731 INFO L226 Difference]: Without dead ends: 8186 [2022-12-14 06:24:09,731 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-12-14 06:24:09,731 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:24:09,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 18 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:24:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8186 states. [2022-12-14 06:24:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8186 to 7642. [2022-12-14 06:24:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7642 states, 7641 states have (on average 4.266326397068447) internal successors, (32599), 7641 states have internal predecessors, (32599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7642 states to 7642 states and 32599 transitions. [2022-12-14 06:24:09,876 INFO L78 Accepts]: Start accepts. Automaton has 7642 states and 32599 transitions. Word has length 34 [2022-12-14 06:24:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:24:09,876 INFO L495 AbstractCegarLoop]: Abstraction has 7642 states and 32599 transitions. [2022-12-14 06:24:09,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7642 states and 32599 transitions. [2022-12-14 06:24:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 06:24:09,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:24:09,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:24:09,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 06:24:09,889 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:24:09,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:24:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash 453489451, now seen corresponding path program 8 times [2022-12-14 06:24:09,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:24:09,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12089850] [2022-12-14 06:24:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:24:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:24:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:24:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:24:10,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:24:10,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12089850] [2022-12-14 06:24:10,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12089850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:24:10,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:24:10,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:24:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328399388] [2022-12-14 06:24:10,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:24:10,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:24:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:24:10,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:24:10,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:24:10,020 INFO L87 Difference]: Start difference. First operand 7642 states and 32599 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:24:10,313 INFO L93 Difference]: Finished difference Result 9842 states and 40587 transitions. [2022-12-14 06:24:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:24:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 35 [2022-12-14 06:24:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:24:10,361 INFO L225 Difference]: With dead ends: 9842 [2022-12-14 06:24:10,361 INFO L226 Difference]: Without dead ends: 9594 [2022-12-14 06:24:10,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:24:10,362 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 57 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:24:10,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 8 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:24:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9594 states. [2022-12-14 06:24:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9594 to 9020. [2022-12-14 06:24:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9020 states, 9019 states have (on average 4.189488856857745) internal successors, (37785), 9019 states have internal predecessors, (37785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 37785 transitions. [2022-12-14 06:24:10,528 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 37785 transitions. Word has length 35 [2022-12-14 06:24:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:24:10,528 INFO L495 AbstractCegarLoop]: Abstraction has 9020 states and 37785 transitions. [2022-12-14 06:24:10,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 37785 transitions. [2022-12-14 06:24:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 06:24:10,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:24:10,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:24:10,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 06:24:10,546 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:24:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:24:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1762092954, now seen corresponding path program 1 times [2022-12-14 06:24:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:24:10,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079718866] [2022-12-14 06:24:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:24:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:24:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:24:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 06:24:10,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:24:10,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079718866] [2022-12-14 06:24:10,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079718866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:24:10,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:24:10,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:24:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287485069] [2022-12-14 06:24:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:24:10,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:24:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:24:10,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:24:10,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:24:10,640 INFO L87 Difference]: Start difference. First operand 9020 states and 37785 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:24:10,809 INFO L93 Difference]: Finished difference Result 11344 states and 46841 transitions. [2022-12-14 06:24:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:24:10,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-12-14 06:24:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:24:10,838 INFO L225 Difference]: With dead ends: 11344 [2022-12-14 06:24:10,838 INFO L226 Difference]: Without dead ends: 10962 [2022-12-14 06:24:10,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:24:10,839 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:24:10,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:24:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10962 states. [2022-12-14 06:24:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10962 to 9703. [2022-12-14 06:24:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9703 states, 9702 states have (on average 4.241702741702742) internal successors, (41153), 9702 states have internal predecessors, (41153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9703 states to 9703 states and 41153 transitions. [2022-12-14 06:24:11,045 INFO L78 Accepts]: Start accepts. Automaton has 9703 states and 41153 transitions. Word has length 35 [2022-12-14 06:24:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:24:11,045 INFO L495 AbstractCegarLoop]: Abstraction has 9703 states and 41153 transitions. [2022-12-14 06:24:11,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 9703 states and 41153 transitions. [2022-12-14 06:24:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 06:24:11,062 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:24:11,062 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:24:11,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 06:24:11,062 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:24:11,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:24:11,063 INFO L85 PathProgramCache]: Analyzing trace with hash -972642371, now seen corresponding path program 9 times [2022-12-14 06:24:11,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:24:11,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34135538] [2022-12-14 06:24:11,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:24:11,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:24:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:24:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 06:24:11,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:24:11,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34135538] [2022-12-14 06:24:11,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34135538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:24:11,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202029976] [2022-12-14 06:24:11,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:24:11,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:24:11,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:24:11,271 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:24:11,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 06:24:11,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:24:11,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:24:11,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 06:24:11,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:24:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 06:24:11,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:24:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 06:24:11,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202029976] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:24:11,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [33098004] [2022-12-14 06:24:11,816 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:24:11,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:24:11,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2022-12-14 06:24:11,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311483364] [2022-12-14 06:24:11,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:24:11,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 06:24:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:24:11,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 06:24:11,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-14 06:24:11,818 INFO L87 Difference]: Start difference. First operand 9703 states and 41153 transitions. Second operand has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:24:13,347 INFO L93 Difference]: Finished difference Result 21123 states and 89099 transitions. [2022-12-14 06:24:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 06:24:13,347 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 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 36 [2022-12-14 06:24:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:24:13,435 INFO L225 Difference]: With dead ends: 21123 [2022-12-14 06:24:13,435 INFO L226 Difference]: Without dead ends: 21123 [2022-12-14 06:24:13,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=607, Unknown=0, NotChecked=0, Total=870 [2022-12-14 06:24:13,435 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 514 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:24:13,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 135 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 06:24:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21123 states. [2022-12-14 06:24:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21123 to 5851. [2022-12-14 06:24:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5851 states, 5850 states have (on average 4.050940170940171) internal successors, (23698), 5850 states have internal predecessors, (23698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5851 states to 5851 states and 23698 transitions. [2022-12-14 06:24:13,622 INFO L78 Accepts]: Start accepts. Automaton has 5851 states and 23698 transitions. Word has length 36 [2022-12-14 06:24:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:24:13,623 INFO L495 AbstractCegarLoop]: Abstraction has 5851 states and 23698 transitions. [2022-12-14 06:24:13,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5851 states and 23698 transitions. [2022-12-14 06:24:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 06:24:13,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:24:13,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:24:13,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 06:24:13,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:24:13,832 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:24:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:24:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash -396716442, now seen corresponding path program 10 times [2022-12-14 06:24:13,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:24:13,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208479704] [2022-12-14 06:24:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:24:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:24:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:24:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:24:14,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:24:14,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208479704] [2022-12-14 06:24:14,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208479704] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:24:14,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110380552] [2022-12-14 06:24:14,587 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:24:14,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:24:14,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:24:14,589 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:24:14,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 06:24:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:24:14,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 06:24:14,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:24:15,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:24:15,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 12 [2022-12-14 06:24:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:24:15,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:24:15,764 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-14 06:24:15,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 52 [2022-12-14 06:24:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:24:16,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110380552] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:24:16,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [571240687] [2022-12-14 06:24:16,149 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:24:16,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:24:16,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-14 06:24:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058051075] [2022-12-14 06:24:16,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:24:16,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 06:24:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:24:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 06:24:16,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2022-12-14 06:24:16,150 INFO L87 Difference]: Start difference. First operand 5851 states and 23698 transitions. Second operand has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:24:23,530 INFO L93 Difference]: Finished difference Result 64106 states and 260211 transitions. [2022-12-14 06:24:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-14 06:24:23,531 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-12-14 06:24:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:24:23,746 INFO L225 Difference]: With dead ends: 64106 [2022-12-14 06:24:23,746 INFO L226 Difference]: Without dead ends: 60776 [2022-12-14 06:24:23,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=833, Invalid=3073, Unknown=0, NotChecked=0, Total=3906 [2022-12-14 06:24:23,747 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 856 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 3045 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:24:23,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 398 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3045 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-12-14 06:24:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60776 states. [2022-12-14 06:24:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60776 to 17262. [2022-12-14 06:24:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17262 states, 17261 states have (on average 4.460691732808065) internal successors, (76996), 17261 states have internal predecessors, (76996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17262 states to 17262 states and 76996 transitions. [2022-12-14 06:24:24,628 INFO L78 Accepts]: Start accepts. Automaton has 17262 states and 76996 transitions. Word has length 37 [2022-12-14 06:24:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:24:24,628 INFO L495 AbstractCegarLoop]: Abstraction has 17262 states and 76996 transitions. [2022-12-14 06:24:24,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:24:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 17262 states and 76996 transitions. [2022-12-14 06:24:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 06:24:24,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:24:24,659 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:24:24,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 06:24:24,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:24:24,861 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 06:24:24,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:24:24,862 INFO L85 PathProgramCache]: Analyzing trace with hash -270122074, now seen corresponding path program 11 times [2022-12-14 06:24:24,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:24:24,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818440562] [2022-12-14 06:24:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:24:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:24:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:24:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:24:25,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:24:25,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818440562] [2022-12-14 06:24:25,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818440562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:24:25,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147155508] [2022-12-14 06:24:25,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:24:25,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:24:25,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:24:25,982 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:24:25,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_512d685f-d162-4cd9-8783-0e7e9d829c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 06:24:26,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 06:24:26,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:24:26,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 06:24:26,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:24:26,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:24:26,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:24:26,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:24:26,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:24:26,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:24:27,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:24:27,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-14 06:24:27,259 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-12-14 06:24:27,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 15 [2022-12-14 06:24:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:24:27,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:24:28,317 WARN L837 $PredicateComparison]: unable to prove that (forall ((~q1_back~0 Int) (v_~q1_front~0_157 Int) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1056) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1057) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1058))) (let ((.cse2 (select .cse1 c_~q1~0.base)) (.cse3 (* ~q1_back~0 4))) (let ((.cse0 (select .cse2 (+ .cse3 c_~q1~0.offset)))) (or (< .cse0 1) (not (<= (+ ~q1_back~0 1) v_~q1_front~0_157)) (not (< v_~q1_front~0_157 c_~n1~0)) (< 0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1059) c_~q1~0.base) (+ (* v_~q1_front~0_157 4) c_~q1~0.offset)) c_~total~0 .cse0)) (< ~q1_back~0 0) (< (select .cse2 (+ .cse3 c_~q1~0.offset 4)) 1)))))) is different from false [2022-12-14 06:24:28,678 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-14 06:24:28,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 118 [2022-12-14 06:24:28,795 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-14 06:24:28,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 234965 treesize of output 222585 [2022-12-14 06:24:29,405 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-12-14 06:24:29,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222520 treesize of output 213214 [2022-12-14 06:24:30,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210934 treesize of output 186358 [2022-12-14 06:24:30,675 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-12-14 06:24:30,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 188624 treesize of output 169998 [2022-12-14 06:24:31,285 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-12-14 06:24:31,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169984 treesize of output 132718