./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/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_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16b049fb81e05ec2192b5dc6cabf7c8b89c1486d4e623332a0a01a89383c6c7d --- 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 05:50:59,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:50:59,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:50:59,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:50:59,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:50:59,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:50:59,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:50:59,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:50:59,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:50:59,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:50:59,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:50:59,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:50:59,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:50:59,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:50:59,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:50:59,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:50:59,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:50:59,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:50:59,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:50:59,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:50:59,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:50:59,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:50:59,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:50:59,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:50:59,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:50:59,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:50:59,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:50:59,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:50:59,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:50:59,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:50:59,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:50:59,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:50:59,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:50:59,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:50:59,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:50:59,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:50:59,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:50:59,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:50:59,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:50:59,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:50:59,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:50:59,726 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-12-14 05:50:59,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:50:59,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:50:59,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:50:59,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:50:59,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:50:59,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:50:59,748 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:50:59,748 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:50:59,748 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:50:59,749 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:50:59,749 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:50:59,749 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:50:59,749 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:50:59,749 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:50:59,749 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:50:59,749 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:50:59,750 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:50:59,750 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:50:59,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:50:59,751 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:50:59,751 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 05:50:59,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:50:59,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:50:59,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:50:59,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:50:59,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:50:59,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:50:59,752 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-14 05:50:59,752 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:50:59,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:50:59,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:50:59,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:50:59,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:50:59,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:50:59,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:50:59,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:50:59,753 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:50:59,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:50:59,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:50:59,754 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:50:59,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:50:59,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:50:59,754 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:50:59,754 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/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_30dc2e63-185e-41c6-ba3f-693f89533f1a/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 ! data-race) ) 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 -> 16b049fb81e05ec2192b5dc6cabf7c8b89c1486d4e623332a0a01a89383c6c7d [2022-12-14 05:50:59,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:50:59,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:50:59,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:50:59,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:50:59,950 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:50:59,951 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i [2022-12-14 05:51:02,448 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:51:02,648 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:51:02,648 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i [2022-12-14 05:51:02,657 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/data/5e8ee4a76/1711b84a69f146b1b1610cf9a5e119a6/FLAGee618e776 [2022-12-14 05:51:03,002 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/data/5e8ee4a76/1711b84a69f146b1b1610cf9a5e119a6 [2022-12-14 05:51:03,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:51:03,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:51:03,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:51:03,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:51:03,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:51:03,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4c4eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03, skipping insertion in model container [2022-12-14 05:51:03,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:51:03,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:51:03,132 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 05:51:03,265 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30448,30461] [2022-12-14 05:51:03,276 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30811,30824] [2022-12-14 05:51:03,291 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31483,31496] [2022-12-14 05:51:03,292 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31534,31547] [2022-12-14 05:51:03,294 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31683,31696] [2022-12-14 05:51:03,295 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31760,31773] [2022-12-14 05:51:03,296 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31807,31820] [2022-12-14 05:51:03,298 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31916,31929] [2022-12-14 05:51:03,300 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32035,32048] [2022-12-14 05:51:03,301 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32083,32096] [2022-12-14 05:51:03,302 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32160,32173] [2022-12-14 05:51:03,304 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32286,32299] [2022-12-14 05:51:03,312 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32869,32882] [2022-12-14 05:51:03,313 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32946,32959] [2022-12-14 05:51:03,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:51:03,324 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:51:03,334 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 05:51:03,353 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30448,30461] [2022-12-14 05:51:03,356 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30811,30824] [2022-12-14 05:51:03,364 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31483,31496] [2022-12-14 05:51:03,365 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31534,31547] [2022-12-14 05:51:03,367 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31683,31696] [2022-12-14 05:51:03,368 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31760,31773] [2022-12-14 05:51:03,368 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31807,31820] [2022-12-14 05:51:03,370 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31916,31929] [2022-12-14 05:51:03,372 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32035,32048] [2022-12-14 05:51:03,372 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32083,32096] [2022-12-14 05:51:03,373 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32160,32173] [2022-12-14 05:51:03,374 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32286,32299] [2022-12-14 05:51:03,381 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32869,32882] [2022-12-14 05:51:03,382 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_30dc2e63-185e-41c6-ba3f-693f89533f1a/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32946,32959] [2022-12-14 05:51:03,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:51:03,406 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:51:03,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03 WrapperNode [2022-12-14 05:51:03,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:51:03,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:51:03,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:51:03,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:51:03,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,479 INFO L138 Inliner]: procedures = 174, calls = 70, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 781 [2022-12-14 05:51:03,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:51:03,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:51:03,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:51:03,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:51:03,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,552 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:51:03,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:51:03,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:51:03,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:51:03,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (1/1) ... [2022-12-14 05:51:03,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:51:03,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:51:03,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:51:03,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:51:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 05:51:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 05:51:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 05:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-12-14 05:51:03,622 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-12-14 05:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 05:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 05:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 05:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 05:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:51:03,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:51:03,624 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 05:51:03,744 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:51:03,745 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:51:04,544 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:51:04,558 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:51:04,558 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-12-14 05:51:04,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:51:04 BoogieIcfgContainer [2022-12-14 05:51:04,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:51:04,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:51:04,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:51:04,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:51:04,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:51:03" (1/3) ... [2022-12-14 05:51:04,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fe994a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:51:04, skipping insertion in model container [2022-12-14 05:51:04,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:51:03" (2/3) ... [2022-12-14 05:51:04,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fe994a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:51:04, skipping insertion in model container [2022-12-14 05:51:04,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:51:04" (3/3) ... [2022-12-14 05:51:04,569 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_2t.i [2022-12-14 05:51:04,577 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 05:51:04,587 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:51:04,588 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2022-12-14 05:51:04,588 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 05:51:04,712 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-14 05:51:04,743 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 05:51:04,754 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 839 places, 898 transitions, 1804 flow [2022-12-14 05:51:04,756 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 839 places, 898 transitions, 1804 flow [2022-12-14 05:51:04,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 839 places, 898 transitions, 1804 flow [2022-12-14 05:51:05,153 INFO L130 PetriNetUnfolder]: 94/1320 cut-off events. [2022-12-14 05:51:05,154 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-14 05:51:05,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1320 events. 94/1320 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4487 event pairs, 0 based on Foata normal form. 0/1110 useless extension candidates. Maximal degree in co-relation 792. Up to 4 conditions per place. [2022-12-14 05:51:05,240 INFO L119 LiptonReduction]: Number of co-enabled transitions 312440 [2022-12-14 05:51:40,858 WARN L233 SmtUtils]: Spent 7.05s on a formula simplification. DAG size of input: 120 DAG size of output: 118 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 05:51:51,305 WARN L233 SmtUtils]: Spent 8.90s on a formula simplification. DAG size of input: 129 DAG size of output: 125 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 05:52:01,500 INFO L134 LiptonReduction]: Checked pairs total: 5065828 [2022-12-14 05:52:01,500 INFO L136 LiptonReduction]: Total number of compositions: 642 [2022-12-14 05:52:01,505 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 436 places, 472 transitions, 952 flow [2022-12-14 05:52:02,185 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45515 states, 44073 states have (on average 2.2289383522791733) internal successors, (98236), 45514 states have internal predecessors, (98236), 0 states have call successors, (0), 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 05:52:02,200 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:52:02,203 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;@1726cea4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:52:02,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2022-12-14 05:52:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 45515 states, 44073 states have (on average 2.2289383522791733) internal successors, (98236), 45514 states have internal predecessors, (98236), 0 states have call successors, (0), 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 05:52:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 05:52:02,245 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:02,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 05:52:02,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 97888, now seen corresponding path program 1 times [2022-12-14 05:52:02,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:02,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309271444] [2022-12-14 05:52:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:02,402 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 05:52:02,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:02,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309271444] [2022-12-14 05:52:02,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309271444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:02,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:02,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 05:52:02,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123865731] [2022-12-14 05:52:02,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:02,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 05:52:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 05:52:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 05:52:02,461 INFO L87 Difference]: Start difference. First operand has 45515 states, 44073 states have (on average 2.2289383522791733) internal successors, (98236), 45514 states have internal predecessors, (98236), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 05:52:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:03,157 INFO L93 Difference]: Finished difference Result 45510 states and 93995 transitions. [2022-12-14 05:52:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 05:52:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 05:52:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:03,369 INFO L225 Difference]: With dead ends: 45510 [2022-12-14 05:52:03,370 INFO L226 Difference]: Without dead ends: 45508 [2022-12-14 05:52:03,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 05:52:03,373 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:03,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:52:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45508 states. [2022-12-14 05:52:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45508 to 45508. [2022-12-14 05:52:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45508 states, 44073 states have (on average 2.1326435686247818) internal successors, (93992), 45507 states have internal predecessors, (93992), 0 states have call successors, (0), 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 05:52:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45508 states to 45508 states and 93992 transitions. [2022-12-14 05:52:04,523 INFO L78 Accepts]: Start accepts. Automaton has 45508 states and 93992 transitions. Word has length 2 [2022-12-14 05:52:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:04,523 INFO L495 AbstractCegarLoop]: Abstraction has 45508 states and 93992 transitions. [2022-12-14 05:52:04,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 05:52:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 45508 states and 93992 transitions. [2022-12-14 05:52:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 05:52:04,524 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:04,524 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-14 05:52:04,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:52:04,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash 884829316, now seen corresponding path program 1 times [2022-12-14 05:52:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:04,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622009461] [2022-12-14 05:52:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:52:04,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:04,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622009461] [2022-12-14 05:52:04,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622009461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:04,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:04,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:52:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847806067] [2022-12-14 05:52:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:04,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:52:04,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:52:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:04,647 INFO L87 Difference]: Start difference. First operand 45508 states and 93992 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 05:52:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:05,290 INFO L93 Difference]: Finished difference Result 45509 states and 93993 transitions. [2022-12-14 05:52:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:52:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 05:52:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:05,440 INFO L225 Difference]: With dead ends: 45509 [2022-12-14 05:52:05,440 INFO L226 Difference]: Without dead ends: 45509 [2022-12-14 05:52:05,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:05,442 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:05,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:52:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45509 states. [2022-12-14 05:52:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45509 to 45509. [2022-12-14 05:52:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45509 states, 44074 states have (on average 2.132617869946) internal successors, (93993), 45508 states have internal predecessors, (93993), 0 states have call successors, (0), 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 05:52:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45509 states to 45509 states and 93993 transitions. [2022-12-14 05:52:06,248 INFO L78 Accepts]: Start accepts. Automaton has 45509 states and 93993 transitions. Word has length 7 [2022-12-14 05:52:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:06,248 INFO L495 AbstractCegarLoop]: Abstraction has 45509 states and 93993 transitions. [2022-12-14 05:52:06,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 05:52:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand 45509 states and 93993 transitions. [2022-12-14 05:52:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:52:06,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:06,249 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:06,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:52:06,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:06,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1484828282, now seen corresponding path program 1 times [2022-12-14 05:52:06,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:06,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728410129] [2022-12-14 05:52:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:06,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:52:06,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:06,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728410129] [2022-12-14 05:52:06,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728410129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:06,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059399174] [2022-12-14 05:52:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:06,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:06,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:52:06,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:52:06,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:52:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:06,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:52:06,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:52:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:52:06,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:52:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:52:06,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059399174] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:52:06,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [940085967] [2022-12-14 05:52:06,482 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 05:52:06,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:52:06,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-14 05:52:06,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172640682] [2022-12-14 05:52:06,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:52:06,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:52:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:52:06,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:52:06,485 INFO L87 Difference]: Start difference. First operand 45509 states and 93993 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:07,281 INFO L93 Difference]: Finished difference Result 45510 states and 93994 transitions. [2022-12-14 05:52:07,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:52:07,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 05:52:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:07,360 INFO L225 Difference]: With dead ends: 45510 [2022-12-14 05:52:07,360 INFO L226 Difference]: Without dead ends: 45510 [2022-12-14 05:52:07,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:52:07,361 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:07,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 05:52:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45510 states. [2022-12-14 05:52:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45510 to 45510. [2022-12-14 05:52:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45510 states, 44075 states have (on average 2.1325921724333523) internal successors, (93994), 45509 states have internal predecessors, (93994), 0 states have call successors, (0), 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 05:52:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45510 states to 45510 states and 93994 transitions. [2022-12-14 05:52:08,030 INFO L78 Accepts]: Start accepts. Automaton has 45510 states and 93994 transitions. Word has length 8 [2022-12-14 05:52:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:08,030 INFO L495 AbstractCegarLoop]: Abstraction has 45510 states and 93994 transitions. [2022-12-14 05:52:08,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 45510 states and 93994 transitions. [2022-12-14 05:52:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 05:52:08,031 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:08,031 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-12-14 05:52:08,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:52:08,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:08,233 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1390040252, now seen corresponding path program 2 times [2022-12-14 05:52:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:08,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194949004] [2022-12-14 05:52:08,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:08,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:08,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:08,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194949004] [2022-12-14 05:52:08,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194949004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:08,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412811049] [2022-12-14 05:52:08,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:52:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:08,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:52:08,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:52:08,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:52:08,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:52:08,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:52:08,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:52:08,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:52:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:08,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:52:08,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412811049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:08,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:52:08,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-14 05:52:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378148727] [2022-12-14 05:52:08,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:08,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:52:08,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:08,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:52:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:52:08,502 INFO L87 Difference]: Start difference. First operand 45510 states and 93994 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 05:52:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:09,179 INFO L93 Difference]: Finished difference Result 45102 states and 93164 transitions. [2022-12-14 05:52:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:52:09,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 05:52:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:09,272 INFO L225 Difference]: With dead ends: 45102 [2022-12-14 05:52:09,272 INFO L226 Difference]: Without dead ends: 45102 [2022-12-14 05:52:09,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 05:52:09,273 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 650 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:09,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 573 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 05:52:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45102 states. [2022-12-14 05:52:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45102 to 45102. [2022-12-14 05:52:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45102 states, 43702 states have (on average 2.1318017482037437) internal successors, (93164), 45101 states have internal predecessors, (93164), 0 states have call successors, (0), 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 05:52:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45102 states to 45102 states and 93164 transitions. [2022-12-14 05:52:10,162 INFO L78 Accepts]: Start accepts. Automaton has 45102 states and 93164 transitions. Word has length 9 [2022-12-14 05:52:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:10,163 INFO L495 AbstractCegarLoop]: Abstraction has 45102 states and 93164 transitions. [2022-12-14 05:52:10,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 05:52:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 45102 states and 93164 transitions. [2022-12-14 05:52:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 05:52:10,163 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:10,163 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:10,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 05:52:10,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:10,365 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:10,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash 94984921, now seen corresponding path program 1 times [2022-12-14 05:52:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:10,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439341253] [2022-12-14 05:52:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:10,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:10,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439341253] [2022-12-14 05:52:10,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439341253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:10,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:10,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:52:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536692922] [2022-12-14 05:52:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:10,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:52:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:52:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:10,468 INFO L87 Difference]: Start difference. First operand 45102 states and 93164 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:11,105 INFO L93 Difference]: Finished difference Result 44901 states and 92954 transitions. [2022-12-14 05:52:11,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:52:11,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 05:52:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:11,184 INFO L225 Difference]: With dead ends: 44901 [2022-12-14 05:52:11,184 INFO L226 Difference]: Without dead ends: 44901 [2022-12-14 05:52:11,185 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 05:52:11,185 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 213 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:11,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 586 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:52:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44901 states. [2022-12-14 05:52:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44901 to 44901. [2022-12-14 05:52:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44901 states, 43535 states have (on average 2.135155621913403) internal successors, (92954), 44900 states have internal predecessors, (92954), 0 states have call successors, (0), 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 05:52:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44901 states to 44901 states and 92954 transitions. [2022-12-14 05:52:11,826 INFO L78 Accepts]: Start accepts. Automaton has 44901 states and 92954 transitions. Word has length 10 [2022-12-14 05:52:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:11,827 INFO L495 AbstractCegarLoop]: Abstraction has 44901 states and 92954 transitions. [2022-12-14 05:52:11,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44901 states and 92954 transitions. [2022-12-14 05:52:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 05:52:11,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:11,827 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:11,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 05:52:11,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:11,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1632008733, now seen corresponding path program 1 times [2022-12-14 05:52:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:11,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307843902] [2022-12-14 05:52:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:12,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:12,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307843902] [2022-12-14 05:52:12,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307843902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:12,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:12,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:52:12,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158363176] [2022-12-14 05:52:12,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:12,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:52:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:12,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:52:12,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:52:12,201 INFO L87 Difference]: Start difference. First operand 44901 states and 92954 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:15,508 INFO L93 Difference]: Finished difference Result 46151 states and 95502 transitions. [2022-12-14 05:52:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:52:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 05:52:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:15,587 INFO L225 Difference]: With dead ends: 46151 [2022-12-14 05:52:15,588 INFO L226 Difference]: Without dead ends: 46151 [2022-12-14 05:52:15,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:52:15,589 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 526 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 4110 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 4447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 4110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:15,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 525 Invalid, 4447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 4110 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-14 05:52:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46151 states. [2022-12-14 05:52:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46151 to 45731. [2022-12-14 05:52:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45731 states, 44366 states have (on average 2.1333002749853494) internal successors, (94646), 45730 states have internal predecessors, (94646), 0 states have call successors, (0), 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 05:52:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45731 states to 45731 states and 94646 transitions. [2022-12-14 05:52:16,279 INFO L78 Accepts]: Start accepts. Automaton has 45731 states and 94646 transitions. Word has length 12 [2022-12-14 05:52:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:16,280 INFO L495 AbstractCegarLoop]: Abstraction has 45731 states and 94646 transitions. [2022-12-14 05:52:16,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 45731 states and 94646 transitions. [2022-12-14 05:52:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 05:52:16,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:16,281 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:16,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 05:52:16,281 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:16,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:16,282 INFO L85 PathProgramCache]: Analyzing trace with hash 328067889, now seen corresponding path program 1 times [2022-12-14 05:52:16,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:16,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884970421] [2022-12-14 05:52:16,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:16,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:52:16,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:16,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884970421] [2022-12-14 05:52:16,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884970421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:16,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:16,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:52:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91093288] [2022-12-14 05:52:16,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:16,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:52:16,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:16,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:52:16,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:52:16,599 INFO L87 Difference]: Start difference. First operand 45731 states and 94646 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:18,587 INFO L93 Difference]: Finished difference Result 46893 states and 97012 transitions. [2022-12-14 05:52:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:52:18,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 05:52:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:18,685 INFO L225 Difference]: With dead ends: 46893 [2022-12-14 05:52:18,685 INFO L226 Difference]: Without dead ends: 46893 [2022-12-14 05:52:18,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:52:18,686 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 480 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:18,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 403 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 05:52:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46893 states. [2022-12-14 05:52:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46893 to 46503. [2022-12-14 05:52:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46503 states, 45138 states have (on average 2.131640746156232) internal successors, (96218), 46502 states have internal predecessors, (96218), 0 states have call successors, (0), 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 05:52:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46503 states to 46503 states and 96218 transitions. [2022-12-14 05:52:19,381 INFO L78 Accepts]: Start accepts. Automaton has 46503 states and 96218 transitions. Word has length 13 [2022-12-14 05:52:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:19,382 INFO L495 AbstractCegarLoop]: Abstraction has 46503 states and 96218 transitions. [2022-12-14 05:52:19,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 46503 states and 96218 transitions. [2022-12-14 05:52:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 05:52:19,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:19,382 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:19,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 05:52:19,383 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash -120323718, now seen corresponding path program 1 times [2022-12-14 05:52:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:19,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126277509] [2022-12-14 05:52:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:19,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:19,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126277509] [2022-12-14 05:52:19,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126277509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:19,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:19,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:52:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061021406] [2022-12-14 05:52:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:19,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:52:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:52:19,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:19,450 INFO L87 Difference]: Start difference. First operand 46503 states and 96218 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:20,353 INFO L93 Difference]: Finished difference Result 46715 states and 96650 transitions. [2022-12-14 05:52:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:52:20,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 05:52:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:20,434 INFO L225 Difference]: With dead ends: 46715 [2022-12-14 05:52:20,434 INFO L226 Difference]: Without dead ends: 46715 [2022-12-14 05:52:20,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:20,435 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 131 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:20,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 330 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 05:52:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46715 states. [2022-12-14 05:52:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46715 to 46715. [2022-12-14 05:52:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46715 states, 45350 states have (on average 2.131201764057332) internal successors, (96650), 46714 states have internal predecessors, (96650), 0 states have call successors, (0), 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 05:52:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46715 states to 46715 states and 96650 transitions. [2022-12-14 05:52:21,115 INFO L78 Accepts]: Start accepts. Automaton has 46715 states and 96650 transitions. Word has length 15 [2022-12-14 05:52:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:21,115 INFO L495 AbstractCegarLoop]: Abstraction has 46715 states and 96650 transitions. [2022-12-14 05:52:21,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 46715 states and 96650 transitions. [2022-12-14 05:52:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:52:21,116 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:21,116 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:21,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 05:52:21,117 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1843137150, now seen corresponding path program 1 times [2022-12-14 05:52:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:21,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733043790] [2022-12-14 05:52:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:52:21,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:21,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733043790] [2022-12-14 05:52:21,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733043790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:21,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:21,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:52:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957431109] [2022-12-14 05:52:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:21,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:52:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:21,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:52:21,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:21,187 INFO L87 Difference]: Start difference. First operand 46715 states and 96650 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:22,111 INFO L93 Difference]: Finished difference Result 46909 states and 97045 transitions. [2022-12-14 05:52:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:52:22,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:52:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:22,207 INFO L225 Difference]: With dead ends: 46909 [2022-12-14 05:52:22,207 INFO L226 Difference]: Without dead ends: 46909 [2022-12-14 05:52:22,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:22,208 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:22,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 324 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 05:52:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46909 states. [2022-12-14 05:52:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46909 to 46909. [2022-12-14 05:52:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46909 states, 45545 states have (on average 2.130749807882314) internal successors, (97045), 46908 states have internal predecessors, (97045), 0 states have call successors, (0), 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 05:52:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46909 states to 46909 states and 97045 transitions. [2022-12-14 05:52:23,135 INFO L78 Accepts]: Start accepts. Automaton has 46909 states and 97045 transitions. Word has length 16 [2022-12-14 05:52:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:23,135 INFO L495 AbstractCegarLoop]: Abstraction has 46909 states and 97045 transitions. [2022-12-14 05:52:23,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 46909 states and 97045 transitions. [2022-12-14 05:52:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:52:23,136 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:23,136 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:23,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 05:52:23,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:23,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1779543694, now seen corresponding path program 1 times [2022-12-14 05:52:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:23,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524995332] [2022-12-14 05:52:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:52:23,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524995332] [2022-12-14 05:52:23,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524995332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:23,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:23,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 05:52:23,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561992628] [2022-12-14 05:52:23,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:23,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 05:52:23,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 05:52:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-14 05:52:23,447 INFO L87 Difference]: Start difference. First operand 46909 states and 97045 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:25,838 INFO L93 Difference]: Finished difference Result 46913 states and 97053 transitions. [2022-12-14 05:52:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 05:52:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 05:52:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:25,938 INFO L225 Difference]: With dead ends: 46913 [2022-12-14 05:52:25,938 INFO L226 Difference]: Without dead ends: 46913 [2022-12-14 05:52:25,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-12-14 05:52:25,939 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 2102 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 2972 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:25,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 1373 Invalid, 2986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2972 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 05:52:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46913 states. [2022-12-14 05:52:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46913 to 46893. [2022-12-14 05:52:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46893 states, 45530 states have (on average 2.130748956731825) internal successors, (97013), 46892 states have internal predecessors, (97013), 0 states have call successors, (0), 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 05:52:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46893 states to 46893 states and 97013 transitions. [2022-12-14 05:52:26,875 INFO L78 Accepts]: Start accepts. Automaton has 46893 states and 97013 transitions. Word has length 18 [2022-12-14 05:52:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:26,875 INFO L495 AbstractCegarLoop]: Abstraction has 46893 states and 97013 transitions. [2022-12-14 05:52:26,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 46893 states and 97013 transitions. [2022-12-14 05:52:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:52:26,876 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:26,876 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:26,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 05:52:26,876 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting worker_fnErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1757547424, now seen corresponding path program 1 times [2022-12-14 05:52:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:26,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510829984] [2022-12-14 05:52:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:26,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:26,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510829984] [2022-12-14 05:52:26,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510829984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:26,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:26,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:52:26,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593059944] [2022-12-14 05:52:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:26,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:52:26,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:26,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:52:26,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:26,967 INFO L87 Difference]: Start difference. First operand 46893 states and 97013 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:28,149 INFO L93 Difference]: Finished difference Result 47923 states and 99113 transitions. [2022-12-14 05:52:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:52:28,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 05:52:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:28,251 INFO L225 Difference]: With dead ends: 47923 [2022-12-14 05:52:28,252 INFO L226 Difference]: Without dead ends: 47923 [2022-12-14 05:52:28,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:28,252 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 134 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:28,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 326 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 05:52:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47923 states. [2022-12-14 05:52:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47923 to 47085. [2022-12-14 05:52:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47085 states, 45724 states have (on average 2.130281690140845) internal successors, (97405), 47084 states have internal predecessors, (97405), 0 states have call successors, (0), 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 05:52:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47085 states to 47085 states and 97405 transitions. [2022-12-14 05:52:29,151 INFO L78 Accepts]: Start accepts. Automaton has 47085 states and 97405 transitions. Word has length 18 [2022-12-14 05:52:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:29,151 INFO L495 AbstractCegarLoop]: Abstraction has 47085 states and 97405 transitions. [2022-12-14 05:52:29,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 47085 states and 97405 transitions. [2022-12-14 05:52:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:52:29,152 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:29,152 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:29,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 05:52:29,152 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:29,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1161258900, now seen corresponding path program 1 times [2022-12-14 05:52:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:29,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207426382] [2022-12-14 05:52:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:29,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:29,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207426382] [2022-12-14 05:52:29,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207426382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:29,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134780960] [2022-12-14 05:52:29,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:29,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:29,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:52:29,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:52:29,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:52:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:29,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 05:52:29,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:52:29,532 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 05:52:29,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2022-12-14 05:52:29,612 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 13 treesize of output 9 [2022-12-14 05:52:29,635 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 16 treesize of output 18 [2022-12-14 05:52:29,646 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 05:52:29,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:52:29,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134780960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:29,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:52:29,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-12-14 05:52:29,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168966244] [2022-12-14 05:52:29,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:29,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:52:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:29,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:52:29,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-14 05:52:29,647 INFO L87 Difference]: Start difference. First operand 47085 states and 97405 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:31,610 INFO L93 Difference]: Finished difference Result 47288 states and 97619 transitions. [2022-12-14 05:52:31,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:52:31,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 05:52:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:31,691 INFO L225 Difference]: With dead ends: 47288 [2022-12-14 05:52:31,691 INFO L226 Difference]: Without dead ends: 47288 [2022-12-14 05:52:31,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-12-14 05:52:31,692 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 1215 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 2356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:31,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1133 Invalid, 2356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 05:52:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47288 states. [2022-12-14 05:52:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47288 to 47069. [2022-12-14 05:52:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47069 states, 45709 states have (on average 2.1302806887046315) internal successors, (97373), 47068 states have internal predecessors, (97373), 0 states have call successors, (0), 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 05:52:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47069 states to 47069 states and 97373 transitions. [2022-12-14 05:52:32,392 INFO L78 Accepts]: Start accepts. Automaton has 47069 states and 97373 transitions. Word has length 18 [2022-12-14 05:52:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:32,393 INFO L495 AbstractCegarLoop]: Abstraction has 47069 states and 97373 transitions. [2022-12-14 05:52:32,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 47069 states and 97373 transitions. [2022-12-14 05:52:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:52:32,394 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:32,394 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:32,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 05:52:32,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:32,595 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2007890335, now seen corresponding path program 1 times [2022-12-14 05:52:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:32,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188315310] [2022-12-14 05:52:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:52:32,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:32,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188315310] [2022-12-14 05:52:32,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188315310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:32,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:32,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:52:32,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761849299] [2022-12-14 05:52:32,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:32,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:52:32,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:32,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:52:32,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:32,678 INFO L87 Difference]: Start difference. First operand 47069 states and 97373 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:33,473 INFO L93 Difference]: Finished difference Result 48018 states and 99306 transitions. [2022-12-14 05:52:33,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:52:33,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 05:52:33,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:33,557 INFO L225 Difference]: With dead ends: 48018 [2022-12-14 05:52:33,557 INFO L226 Difference]: Without dead ends: 48018 [2022-12-14 05:52:33,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:33,558 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 123 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:33,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 322 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 05:52:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48018 states. [2022-12-14 05:52:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48018 to 47244. [2022-12-14 05:52:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47244 states, 45887 states have (on average 2.1297971102926754) internal successors, (97730), 47243 states have internal predecessors, (97730), 0 states have call successors, (0), 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 05:52:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47244 states to 47244 states and 97730 transitions. [2022-12-14 05:52:34,248 INFO L78 Accepts]: Start accepts. Automaton has 47244 states and 97730 transitions. Word has length 19 [2022-12-14 05:52:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:34,248 INFO L495 AbstractCegarLoop]: Abstraction has 47244 states and 97730 transitions. [2022-12-14 05:52:34,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 47244 states and 97730 transitions. [2022-12-14 05:52:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:52:34,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:34,249 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] [2022-12-14 05:52:34,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 05:52:34,249 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash 551709998, now seen corresponding path program 1 times [2022-12-14 05:52:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:34,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252332956] [2022-12-14 05:52:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:52:34,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:34,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252332956] [2022-12-14 05:52:34,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252332956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:34,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:34,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 05:52:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675918828] [2022-12-14 05:52:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:34,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 05:52:34,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:34,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 05:52:34,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-14 05:52:34,632 INFO L87 Difference]: Start difference. First operand 47244 states and 97730 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:37,755 INFO L93 Difference]: Finished difference Result 53650 states and 110948 transitions. [2022-12-14 05:52:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:52:37,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:52:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:37,854 INFO L225 Difference]: With dead ends: 53650 [2022-12-14 05:52:37,854 INFO L226 Difference]: Without dead ends: 53650 [2022-12-14 05:52:37,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-12-14 05:52:37,855 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 2145 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 4336 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 4692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 4336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:37,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 838 Invalid, 4692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 4336 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-12-14 05:52:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53650 states. [2022-12-14 05:52:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53650 to 47054. [2022-12-14 05:52:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47054 states, 45702 states have (on average 2.1299943109710733) internal successors, (97345), 47053 states have internal predecessors, (97345), 0 states have call successors, (0), 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 05:52:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47054 states to 47054 states and 97345 transitions. [2022-12-14 05:52:38,594 INFO L78 Accepts]: Start accepts. Automaton has 47054 states and 97345 transitions. Word has length 21 [2022-12-14 05:52:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:38,594 INFO L495 AbstractCegarLoop]: Abstraction has 47054 states and 97345 transitions. [2022-12-14 05:52:38,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 47054 states and 97345 transitions. [2022-12-14 05:52:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:52:38,595 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:38,595 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] [2022-12-14 05:52:38,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 05:52:38,595 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash -829070948, now seen corresponding path program 1 times [2022-12-14 05:52:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:38,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016891984] [2022-12-14 05:52:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:38,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:38,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016891984] [2022-12-14 05:52:38,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016891984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:38,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:38,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:52:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363802772] [2022-12-14 05:52:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:38,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:52:38,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:38,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:52:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:38,697 INFO L87 Difference]: Start difference. First operand 47054 states and 97345 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:39,587 INFO L93 Difference]: Finished difference Result 47248 states and 97741 transitions. [2022-12-14 05:52:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:52:39,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:52:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:39,670 INFO L225 Difference]: With dead ends: 47248 [2022-12-14 05:52:39,670 INFO L226 Difference]: Without dead ends: 47248 [2022-12-14 05:52:39,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:39,671 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 130 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:39,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 326 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 05:52:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47248 states. [2022-12-14 05:52:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47248 to 47248. [2022-12-14 05:52:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47248 states, 45898 states have (on average 2.129526341017038) internal successors, (97741), 47247 states have internal predecessors, (97741), 0 states have call successors, (0), 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 05:52:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47248 states to 47248 states and 97741 transitions. [2022-12-14 05:52:40,433 INFO L78 Accepts]: Start accepts. Automaton has 47248 states and 97741 transitions. Word has length 21 [2022-12-14 05:52:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:40,433 INFO L495 AbstractCegarLoop]: Abstraction has 47248 states and 97741 transitions. [2022-12-14 05:52:40,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 47248 states and 97741 transitions. [2022-12-14 05:52:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:52:40,434 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:40,434 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] [2022-12-14 05:52:40,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 05:52:40,434 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting worker_fnErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:40,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash 96829360, now seen corresponding path program 1 times [2022-12-14 05:52:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:40,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083925174] [2022-12-14 05:52:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:40,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:40,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083925174] [2022-12-14 05:52:40,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083925174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:40,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:52:40,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:52:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745600542] [2022-12-14 05:52:40,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:40,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:52:40,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:40,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:52:40,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:52:40,479 INFO L87 Difference]: Start difference. First operand 47248 states and 97741 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:41,057 INFO L93 Difference]: Finished difference Result 49404 states and 102133 transitions. [2022-12-14 05:52:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:52:41,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:52:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:41,152 INFO L225 Difference]: With dead ends: 49404 [2022-12-14 05:52:41,152 INFO L226 Difference]: Without dead ends: 49404 [2022-12-14 05:52:41,153 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 05:52:41,153 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 234 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:41,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 728 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:52:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49404 states. [2022-12-14 05:52:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49404 to 47469. [2022-12-14 05:52:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47469 states, 46119 states have (on average 2.129079121403326) internal successors, (98191), 47468 states have internal predecessors, (98191), 0 states have call successors, (0), 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 05:52:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47469 states to 47469 states and 98191 transitions. [2022-12-14 05:52:41,851 INFO L78 Accepts]: Start accepts. Automaton has 47469 states and 98191 transitions. Word has length 21 [2022-12-14 05:52:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:41,851 INFO L495 AbstractCegarLoop]: Abstraction has 47469 states and 98191 transitions. [2022-12-14 05:52:41,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:52:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 47469 states and 98191 transitions. [2022-12-14 05:52:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:52:41,851 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:41,851 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] [2022-12-14 05:52:41,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 05:52:41,852 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 05:52:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1389940497, now seen corresponding path program 1 times [2022-12-14 05:52:41,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:41,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18776168] [2022-12-14 05:52:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:41,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:42,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:42,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18776168] [2022-12-14 05:52:42,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18776168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:42,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403369415] [2022-12-14 05:52:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:42,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:42,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:52:42,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:52:42,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:52:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:43,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 05:52:43,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:52:43,036 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:52:43,037 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 20 treesize of output 22 [2022-12-14 05:52:43,114 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 13 treesize of output 9 [2022-12-14 05:52:43,143 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 23 treesize of output 22 [2022-12-14 05:52:43,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-14 05:52:43,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-12-14 05:52:43,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-12-14 05:52:43,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-12-14 05:52:43,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-12-14 05:52:43,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:43,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-12-14 05:52:48,492 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 52 treesize of output 46 [2022-12-14 05:52:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:52:53,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:53:29,101 INFO L321 Elim1Store]: treesize reduction 590, result has 26.3 percent of original size [2022-12-14 05:53:29,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 223 [2022-12-14 05:53:29,113 INFO L321 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-12-14 05:53:29,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 206 treesize of output 170 [2022-12-14 05:53:29,179 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 7 treesize of output 3 [2022-12-14 05:53:29,225 INFO L321 Elim1Store]: treesize reduction 800, result has 0.1 percent of original size [2022-12-14 05:53:29,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2022-12-14 05:53:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:53:33,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403369415] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:53:33,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [546171500] [2022-12-14 05:53:33,243 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 05:53:33,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:53:33,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 35 [2022-12-14 05:53:33,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530695888] [2022-12-14 05:53:33,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:53:33,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 05:53:33,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:53:33,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 05:53:33,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1049, Unknown=50, NotChecked=0, Total=1332 [2022-12-14 05:53:33,245 INFO L87 Difference]: Start difference. First operand 47469 states and 98191 transitions. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 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 05:53:37,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:53:48,160 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 [0] [2022-12-14 05:53:50,194 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 [0] [2022-12-14 05:53:52,203 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 [0] [2022-12-14 05:53:58,707 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 [0] [2022-12-14 05:54:00,716 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 [0] [2022-12-14 05:54:07,232 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 [0] [2022-12-14 05:54:14,555 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 [0] [2022-12-14 05:54:17,147 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 [0] [2022-12-14 05:54:19,177 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 [0] [2022-12-14 05:54:21,189 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 [0] [2022-12-14 05:54:23,673 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 [0] [2022-12-14 05:54:25,677 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 [0] [2022-12-14 05:54:27,739 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 [0] [2022-12-14 05:54:30,265 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 [0] [2022-12-14 05:54:32,931 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 [0] [2022-12-14 05:54:34,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:54:36,978 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 [0] [2022-12-14 05:54:38,988 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 [0] [2022-12-14 05:54:41,716 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 [0] [2022-12-14 05:54:43,725 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 [0] [2022-12-14 05:54:46,489 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 [0] [2022-12-14 05:54:48,501 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 [0] [2022-12-14 05:54:51,342 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 [0] [2022-12-14 05:54:54,149 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 [0] [2022-12-14 05:54:57,799 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 [0] [2022-12-14 05:54:59,809 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 [0] [2022-12-14 05:55:01,850 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 [0] [2022-12-14 05:55:03,881 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 [0] [2022-12-14 05:55:07,723 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 [0] [2022-12-14 05:55:09,810 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 [0] [2022-12-14 05:55:11,815 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 [0] [2022-12-14 05:55:14,550 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 [0] [2022-12-14 05:55:16,622 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 [0] [2022-12-14 05:55:18,626 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 [0] [2022-12-14 05:55:20,751 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 [0] [2022-12-14 05:55:23,501 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 [0] [2022-12-14 05:55:25,559 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 [0] [2022-12-14 05:55:29,764 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 [0] [2022-12-14 05:55:31,832 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 [0] [2022-12-14 05:55:33,870 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 [0] [2022-12-14 05:55:35,878 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 [0] [2022-12-14 05:55:37,991 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 [0] [2022-12-14 05:55:40,020 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 [0] [2022-12-14 05:55:42,062 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 [0] [2022-12-14 05:55:44,114 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 [0] [2022-12-14 05:55:46,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 [0] [2022-12-14 05:55:48,816 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 [0] [2022-12-14 05:55:50,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:55:52,018 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 [0] [2022-12-14 05:55:54,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:55:56,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:55:58,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:56:00,062 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 [0] [2022-12-14 05:56:02,653 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 [0] [2022-12-14 05:56:04,661 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 [0] [2022-12-14 05:56:08,422 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 [0] [2022-12-14 05:56:10,439 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 [0] [2022-12-14 05:56:14,542 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 [0] [2022-12-14 05:56:16,579 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 [0] [2022-12-14 05:56:18,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 [0] [2022-12-14 05:56:20,678 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 [0] [2022-12-14 05:56:23,092 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 [0] [2022-12-14 05:56:25,100 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 [0] [2022-12-14 05:56:27,108 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 [0] [2022-12-14 05:56:29,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:56:31,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:56:33,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:56:35,840 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 [0] [2022-12-14 05:56:37,846 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 [0] [2022-12-14 05:56:39,856 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 [0] [2022-12-14 05:56:43,256 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 [0] [2022-12-14 05:56:47,107 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 [0] [2022-12-14 05:56:49,146 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 [0] [2022-12-14 05:56:51,846 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 [0] [2022-12-14 05:56:54,276 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 [0] [2022-12-14 05:56:56,283 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 [0] [2022-12-14 05:56:58,339 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 [0] [2022-12-14 05:57:00,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:57:02,907 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 [0] [2022-12-14 05:57:05,716 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 [0] [2022-12-14 05:57:07,750 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 [0] [2022-12-14 05:57:10,324 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 [0] [2022-12-14 05:57:12,388 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 [0] [2022-12-14 05:57:17,212 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 [0] [2022-12-14 05:57:19,247 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 [0] [2022-12-14 05:57:21,304 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 [0] [2022-12-14 05:57:23,331 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 [0] [2022-12-14 05:57:25,797 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 [0] [2022-12-14 05:57:27,803 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 [0] [2022-12-14 05:57:29,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:57:31,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:57:34,531 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 [0] [2022-12-14 05:57:36,540 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 [0] [2022-12-14 05:57:41,262 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 [0] [2022-12-14 05:57:43,300 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 [0] [2022-12-14 05:57:45,906 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 [0] [2022-12-14 05:57:50,668 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 [0] [2022-12-14 05:57:52,705 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 [0] [2022-12-14 05:57:55,137 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 [0] [2022-12-14 05:58:02,351 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 [0] [2022-12-14 05:58:04,380 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 [0] [2022-12-14 05:58:13,080 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 [0] [2022-12-14 05:58:15,112 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 [0] [2022-12-14 05:58:18,753 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 [0] [2022-12-14 05:58:20,790 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 [0] [2022-12-14 05:58:24,505 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 [0] [2022-12-14 05:58:26,550 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 [0] [2022-12-14 05:58:29,565 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 [0] [2022-12-14 05:58:31,735 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 [0] [2022-12-14 05:58:33,766 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 [0] [2022-12-14 05:58:35,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:58:37,423 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 [0] [2022-12-14 05:58:41,181 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 [0] [2022-12-14 05:58:47,131 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 [0] [2022-12-14 05:58:49,159 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 [0] [2022-12-14 05:58:51,200 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 [0] [2022-12-14 05:58:55,686 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 [0] [2022-12-14 05:58:57,719 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 [0] [2022-12-14 05:58:59,748 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 [0] [2022-12-14 05:59:04,868 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 [0] [2022-12-14 05:59:06,912 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 [0] [2022-12-14 05:59:09,427 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 [0] [2022-12-14 05:59:14,904 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 [0] [2022-12-14 05:59:17,386 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 [0] [2022-12-14 05:59:22,925 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 [0] [2022-12-14 05:59:26,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:59:30,786 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 [0] [2022-12-14 05:59:32,818 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 [0] [2022-12-14 05:59:38,538 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 [0] [2022-12-14 05:59:40,569 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 [0] [2022-12-14 05:59:43,141 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 [0] [2022-12-14 05:59:49,823 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 [0] [2022-12-14 05:59:56,335 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 [0] [2022-12-14 05:59:58,363 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 [0] [2022-12-14 06:00:00,392 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 [0] [2022-12-14 06:00:03,148 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 [0] [2022-12-14 06:00:08,281 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 [0] [2022-12-14 06:00:10,310 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 [0] [2022-12-14 06:00:13,243 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 [0] [2022-12-14 06:00:16,296 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 [0] [2022-12-14 06:00:18,323 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 [0] [2022-12-14 06:00:21,337 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 [0] [2022-12-14 06:00:24,251 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 [0] [2022-12-14 06:00:33,891 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 [0] [2022-12-14 06:00:35,938 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 [0] [2022-12-14 06:00:39,996 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 [0] [2022-12-14 06:00:42,026 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 [0] [2022-12-14 06:00:46,237 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 [0] [2022-12-14 06:00:48,271 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 [0] [2022-12-14 06:00:50,451 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 [0] [2022-12-14 06:00:52,484 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 [0] [2022-12-14 06:00:56,276 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 [0] [2022-12-14 06:00:58,308 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 [0] [2022-12-14 06:01:01,014 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 [0] [2022-12-14 06:01:03,045 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 [0] [2022-12-14 06:01:06,517 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 [0] [2022-12-14 06:01:09,562 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 [0] [2022-12-14 06:01:15,575 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 [0] [2022-12-14 06:01:17,606 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 [0] [2022-12-14 06:01:19,866 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 [0] [2022-12-14 06:01:21,909 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 [0] [2022-12-14 06:01:24,515 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 [0] [2022-12-14 06:01:26,668 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 [0] [2022-12-14 06:01:29,031 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 [0] [2022-12-14 06:01:31,069 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 [0] [2022-12-14 06:01:33,596 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 [0] [2022-12-14 06:01:35,630 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 [0] [2022-12-14 06:01:37,671 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 [0] [2022-12-14 06:01:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:48,303 INFO L93 Difference]: Finished difference Result 58669 states and 121317 transitions. [2022-12-14 06:01:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 06:01:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 06:01:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:48,408 INFO L225 Difference]: With dead ends: 58669 [2022-12-14 06:01:48,408 INFO L226 Difference]: Without dead ends: 58669 [2022-12-14 06:01:48,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=496, Invalid=1799, Unknown=57, NotChecked=0, Total=2352 [2022-12-14 06:01:48,409 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 4437 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 16676 mSolverCounterSat, 1305 mSolverCounterUnsat, 192 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 473.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 18173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1305 IncrementalHoareTripleChecker+Valid, 16676 IncrementalHoareTripleChecker+Invalid, 192 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 478.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:48,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 2742 Invalid, 18173 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1305 Valid, 16676 Invalid, 192 Unknown, 0 Unchecked, 478.3s Time] [2022-12-14 06:01:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58669 states. [2022-12-14 06:01:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58669 to 47279. [2022-12-14 06:01:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47279 states, 45934 states have (on average 2.129272434362346) internal successors, (97806), 47278 states have internal predecessors, (97806), 0 states have call successors, (0), 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:01:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47279 states to 47279 states and 97806 transitions. [2022-12-14 06:01:49,161 INFO L78 Accepts]: Start accepts. Automaton has 47279 states and 97806 transitions. Word has length 21 [2022-12-14 06:01:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:49,161 INFO L495 AbstractCegarLoop]: Abstraction has 47279 states and 97806 transitions. [2022-12-14 06:01:49,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 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:01:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 47279 states and 97806 transitions. [2022-12-14 06:01:49,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 06:01:49,161 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:49,162 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] [2022-12-14 06:01:49,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 06:01:49,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:01:49,363 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:01:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1048739451, now seen corresponding path program 1 times [2022-12-14 06:01:49,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:01:49,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409401250] [2022-12-14 06:01:49,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:49,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:01:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 06:01:49,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:01:49,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409401250] [2022-12-14 06:01:49,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409401250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:49,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:49,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:01:49,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130197181] [2022-12-14 06:01:49,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:49,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:01:49,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:01:49,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:01:49,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:01:49,485 INFO L87 Difference]: Start difference. First operand 47279 states and 97806 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:50,489 INFO L93 Difference]: Finished difference Result 47457 states and 98169 transitions. [2022-12-14 06:01:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:01:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 06:01:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:50,572 INFO L225 Difference]: With dead ends: 47457 [2022-12-14 06:01:50,572 INFO L226 Difference]: Without dead ends: 47457 [2022-12-14 06:01:50,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:01:50,573 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 119 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:50,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 323 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 06:01:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47457 states. [2022-12-14 06:01:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47457 to 47457. [2022-12-14 06:01:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47457 states, 46115 states have (on average 2.128786728830099) internal successors, (98169), 47456 states have internal predecessors, (98169), 0 states have call successors, (0), 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:01:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47457 states to 47457 states and 98169 transitions. [2022-12-14 06:01:51,254 INFO L78 Accepts]: Start accepts. Automaton has 47457 states and 98169 transitions. Word has length 22 [2022-12-14 06:01:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:51,254 INFO L495 AbstractCegarLoop]: Abstraction has 47457 states and 98169 transitions. [2022-12-14 06:01:51,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 47457 states and 98169 transitions. [2022-12-14 06:01:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 06:01:51,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:51,255 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] [2022-12-14 06:01:51,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 06:01:51,255 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:01:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash -47009765, now seen corresponding path program 1 times [2022-12-14 06:01:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:01:51,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772543281] [2022-12-14 06:01:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:01:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 06:01:51,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:01:51,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772543281] [2022-12-14 06:01:51,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772543281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:51,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:51,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:01:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929061230] [2022-12-14 06:01:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:51,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:01:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:01:51,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:01:51,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:01:51,298 INFO L87 Difference]: Start difference. First operand 47457 states and 98169 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:51,972 INFO L93 Difference]: Finished difference Result 49469 states and 102263 transitions. [2022-12-14 06:01:51,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:01:51,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 06:01:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:52,064 INFO L225 Difference]: With dead ends: 49469 [2022-12-14 06:01:52,065 INFO L226 Difference]: Without dead ends: 49469 [2022-12-14 06:01:52,065 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:01:52,065 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 217 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:52,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 715 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 06:01:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49469 states. [2022-12-14 06:01:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49469 to 47664. [2022-12-14 06:01:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47664 states, 46322 states have (on average 2.128362333232589) internal successors, (98590), 47663 states have internal predecessors, (98590), 0 states have call successors, (0), 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:01:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47664 states to 47664 states and 98590 transitions. [2022-12-14 06:01:52,778 INFO L78 Accepts]: Start accepts. Automaton has 47664 states and 98590 transitions. Word has length 22 [2022-12-14 06:01:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:52,778 INFO L495 AbstractCegarLoop]: Abstraction has 47664 states and 98590 transitions. [2022-12-14 06:01:52,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 47664 states and 98590 transitions. [2022-12-14 06:01:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:01:52,778 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:52,779 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] [2022-12-14 06:01:52,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 06:01:52,779 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:01:52,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash -324605347, now seen corresponding path program 1 times [2022-12-14 06:01:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:01:52,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654073166] [2022-12-14 06:01:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:01:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:53,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:01:53,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654073166] [2022-12-14 06:01:53,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654073166] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:01:53,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045848132] [2022-12-14 06:01:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:53,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:01:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:01:53,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:01:53,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 06:01:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:53,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-14 06:01:53,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:53,866 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-14 06:01:53,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-12-14 06:01:53,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-12-14 06:01:53,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:01:54,026 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 25 treesize of output 25 [2022-12-14 06:01:54,044 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-14 06:01:54,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 06:01:54,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 06:01:54,361 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 34 treesize of output 32 [2022-12-14 06:01:54,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-14 06:01:54,497 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 13 treesize of output 9 [2022-12-14 06:01:54,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:01:54,539 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 21 treesize of output 20 [2022-12-14 06:01:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:54,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:01:54,625 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 17 [2022-12-14 06:01:54,718 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2464 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2464) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|)) |c_worker_fnThread1of1ForFork0_~tid~0#1|))) is different from false [2022-12-14 06:01:55,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:01:55,240 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 4 case distinctions, treesize of input 109 treesize of output 86 [2022-12-14 06:01:55,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:01:55,260 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 747 treesize of output 699 [2022-12-14 06:01:55,272 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 646 treesize of output 582 [2022-12-14 06:01:55,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:01:55,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 582 treesize of output 486 [2022-12-14 06:01:55,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:01:55,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 486 treesize of output 438 [2022-12-14 06:01:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:55,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045848132] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:01:55,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [646092561] [2022-12-14 06:01:55,454 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:01:55,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:01:55,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 38 [2022-12-14 06:01:55,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176809784] [2022-12-14 06:01:55,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:01:55,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 06:01:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:01:55,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 06:01:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1317, Unknown=41, NotChecked=74, Total=1560 [2022-12-14 06:01:55,457 INFO L87 Difference]: Start difference. First operand 47664 states and 98590 transitions. Second operand has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 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:02:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:02:12,587 INFO L93 Difference]: Finished difference Result 92813 states and 192058 transitions. [2022-12-14 06:02:12,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 06:02:12,588 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 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 24 [2022-12-14 06:02:12,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:02:12,771 INFO L225 Difference]: With dead ends: 92813 [2022-12-14 06:02:12,771 INFO L226 Difference]: Without dead ends: 92813 [2022-12-14 06:02:12,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=404, Invalid=2748, Unknown=44, NotChecked=110, Total=3306 [2022-12-14 06:02:12,772 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 2898 mSDsluCounter, 10925 mSDsCounter, 0 mSdLazyCounter, 15883 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2898 SdHoareTripleChecker+Valid, 11599 SdHoareTripleChecker+Invalid, 17321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 15883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1400 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:02:12,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2898 Valid, 11599 Invalid, 17321 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 15883 Invalid, 0 Unknown, 1400 Unchecked, 15.4s Time] [2022-12-14 06:02:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92813 states. [2022-12-14 06:02:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92813 to 47681. [2022-12-14 06:02:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47681 states, 46339 states have (on average 2.12831524202076) internal successors, (98624), 47680 states have internal predecessors, (98624), 0 states have call successors, (0), 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:02:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47681 states to 47681 states and 98624 transitions. [2022-12-14 06:02:13,736 INFO L78 Accepts]: Start accepts. Automaton has 47681 states and 98624 transitions. Word has length 24 [2022-12-14 06:02:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:02:13,736 INFO L495 AbstractCegarLoop]: Abstraction has 47681 states and 98624 transitions. [2022-12-14 06:02:13,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 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:02:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 47681 states and 98624 transitions. [2022-12-14 06:02:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:02:13,736 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:02:13,737 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] [2022-12-14 06:02:13,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 06:02:13,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:02:13,938 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:02:13,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:02:13,939 INFO L85 PathProgramCache]: Analyzing trace with hash -324945556, now seen corresponding path program 1 times [2022-12-14 06:02:13,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:02:13,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720390862] [2022-12-14 06:02:13,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:02:13,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:02:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:02:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:14,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:02:14,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720390862] [2022-12-14 06:02:14,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720390862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:02:14,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115038876] [2022-12-14 06:02:14,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:02:14,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:02:14,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:02:14,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:02:14,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 06:02:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:02:14,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-14 06:02:14,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:02:15,001 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-14 06:02:15,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-12-14 06:02:15,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:02:15,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:02:15,143 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 25 treesize of output 25 [2022-12-14 06:02:15,158 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-14 06:02:15,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 06:02:15,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 06:02:15,417 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 34 treesize of output 32 [2022-12-14 06:02:15,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-14 06:02:15,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 13 treesize of output 9 [2022-12-14 06:02:15,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:02:15,544 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 23 treesize of output 22 [2022-12-14 06:02:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:15,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:02:15,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2724 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2724) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|)) |c_worker_fnThread1of1ForFork0_#t~mem17#1|))) is different from false [2022-12-14 06:02:15,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2723 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2723))) (= (select (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ 8 (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2724) |c_ULTIMATE.start_main_~#a~1#1.base|) (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|)))))) is different from false [2022-12-14 06:02:16,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:16,038 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 4 case distinctions, treesize of input 109 treesize of output 86 [2022-12-14 06:02:16,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:16,065 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 2931 treesize of output 2667 [2022-12-14 06:02:16,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:16,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2614 treesize of output 2422 [2022-12-14 06:02:16,111 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 2422 treesize of output 2166 [2022-12-14 06:02:16,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:16,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2166 treesize of output 1782 [2022-12-14 06:02:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 06:02:16,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115038876] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:02:16,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1644591756] [2022-12-14 06:02:16,346 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:02:16,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:02:16,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 36 [2022-12-14 06:02:16,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120947420] [2022-12-14 06:02:16,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:02:16,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 06:02:16,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:02:16,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 06:02:16,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1121, Unknown=33, NotChecked=138, Total=1406 [2022-12-14 06:02:16,348 INFO L87 Difference]: Start difference. First operand 47681 states and 98624 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 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:02:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:02:32,625 INFO L93 Difference]: Finished difference Result 92821 states and 192074 transitions. [2022-12-14 06:02:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 06:02:32,625 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 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 24 [2022-12-14 06:02:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:02:32,806 INFO L225 Difference]: With dead ends: 92821 [2022-12-14 06:02:32,806 INFO L226 Difference]: Without dead ends: 92821 [2022-12-14 06:02:32,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=329, Invalid=2507, Unknown=34, NotChecked=210, Total=3080 [2022-12-14 06:02:32,808 INFO L413 NwaCegarLoop]: 676 mSDtfsCounter, 3004 mSDsluCounter, 12526 mSDsCounter, 0 mSdLazyCounter, 15749 mSolverCounterSat, 28 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3004 SdHoareTripleChecker+Valid, 13202 SdHoareTripleChecker+Invalid, 18057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 15749 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 2266 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:02:32,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3004 Valid, 13202 Invalid, 18057 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 15749 Invalid, 14 Unknown, 2266 Unchecked, 15.0s Time] [2022-12-14 06:02:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92821 states. [2022-12-14 06:02:33,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92821 to 47684. [2022-12-14 06:02:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47684 states, 46342 states have (on average 2.1283069353933795) internal successors, (98630), 47683 states have internal predecessors, (98630), 0 states have call successors, (0), 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:02:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47684 states to 47684 states and 98630 transitions. [2022-12-14 06:02:33,764 INFO L78 Accepts]: Start accepts. Automaton has 47684 states and 98630 transitions. Word has length 24 [2022-12-14 06:02:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:02:33,764 INFO L495 AbstractCegarLoop]: Abstraction has 47684 states and 98630 transitions. [2022-12-14 06:02:33,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 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:02:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 47684 states and 98630 transitions. [2022-12-14 06:02:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:02:33,765 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:02:33,765 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] [2022-12-14 06:02:33,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 06:02:33,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 06:02:33,967 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:02:33,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:02:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1398946024, now seen corresponding path program 2 times [2022-12-14 06:02:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:02:33,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849721700] [2022-12-14 06:02:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:02:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:02:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:02:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:34,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:02:34,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849721700] [2022-12-14 06:02:34,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849721700] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:02:34,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317999559] [2022-12-14 06:02:34,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:02:34,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:02:34,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:02:34,729 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:02:34,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 06:02:35,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:02:35,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:02:35,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-14 06:02:35,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:02:35,328 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-14 06:02:35,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-12-14 06:02:35,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-12-14 06:02:35,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:02:35,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 06:02:35,508 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 06:02:35,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 06:02:35,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 06:02:35,757 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 34 treesize of output 32 [2022-12-14 06:02:35,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-14 06:02:35,833 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 13 treesize of output 9 [2022-12-14 06:02:35,870 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 16 treesize of output 18 [2022-12-14 06:02:35,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:02:35,945 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 23 treesize of output 22 [2022-12-14 06:02:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:35,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:02:36,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:36,147 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 27 treesize of output 28 [2022-12-14 06:02:36,149 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 48 treesize of output 42 [2022-12-14 06:02:36,153 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 32 treesize of output 28 [2022-12-14 06:02:36,154 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 50 treesize of output 38 [2022-12-14 06:02:36,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:36,609 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 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 06:02:36,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:36,626 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 111 treesize of output 123 [2022-12-14 06:02:36,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:36,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 54 [2022-12-14 06:02:36,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:36,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 46 [2022-12-14 06:02:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:36,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317999559] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:02:36,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1557226107] [2022-12-14 06:02:36,764 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:02:36,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:02:36,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 38 [2022-12-14 06:02:36,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716465620] [2022-12-14 06:02:36,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:02:36,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 06:02:36,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:02:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 06:02:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1402, Unknown=15, NotChecked=0, Total=1560 [2022-12-14 06:02:36,767 INFO L87 Difference]: Start difference. First operand 47684 states and 98630 transitions. Second operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 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:02:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:02:50,885 INFO L93 Difference]: Finished difference Result 49650 states and 102634 transitions. [2022-12-14 06:02:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 06:02:50,885 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 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 24 [2022-12-14 06:02:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:02:50,979 INFO L225 Difference]: With dead ends: 49650 [2022-12-14 06:02:50,979 INFO L226 Difference]: Without dead ends: 49650 [2022-12-14 06:02:50,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=417, Invalid=2429, Unknown=16, NotChecked=0, Total=2862 [2022-12-14 06:02:50,980 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 1633 mSDsluCounter, 5812 mSDsCounter, 0 mSdLazyCounter, 13163 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 6269 SdHoareTripleChecker+Invalid, 13202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-12-14 06:02:50,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 6269 Invalid, 13202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13163 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2022-12-14 06:02:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49650 states. [2022-12-14 06:02:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49650 to 47688. [2022-12-14 06:02:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47688 states, 46346 states have (on average 2.128295861563026) internal successors, (98638), 47687 states have internal predecessors, (98638), 0 states have call successors, (0), 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:02:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47688 states to 47688 states and 98638 transitions. [2022-12-14 06:02:51,682 INFO L78 Accepts]: Start accepts. Automaton has 47688 states and 98638 transitions. Word has length 24 [2022-12-14 06:02:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:02:51,682 INFO L495 AbstractCegarLoop]: Abstraction has 47688 states and 98638 transitions. [2022-12-14 06:02:51,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 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:02:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 47688 states and 98638 transitions. [2022-12-14 06:02:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:02:51,683 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:02:51,683 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] [2022-12-14 06:02:51,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 06:02:51,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:02:51,884 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:02:51,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:02:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1157976029, now seen corresponding path program 2 times [2022-12-14 06:02:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:02:51,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107192424] [2022-12-14 06:02:51,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:02:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:02:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:02:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:52,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:02:52,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107192424] [2022-12-14 06:02:52,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107192424] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:02:52,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19232314] [2022-12-14 06:02:52,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:02:52,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:02:52,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:02:52,521 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:02:52,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 06:02:53,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:02:53,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:02:53,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-14 06:02:53,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:02:53,138 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:02:53,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-12-14 06:02:53,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:02:53,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:02:53,242 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 25 treesize of output 25 [2022-12-14 06:02:53,253 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 06:02:53,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-12-14 06:02:53,282 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 25 treesize of output 25 [2022-12-14 06:02:53,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:53,409 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 29 treesize of output 13 [2022-12-14 06:02:53,491 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 13 treesize of output 9 [2022-12-14 06:02:53,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:02:53,523 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 21 treesize of output 20 [2022-12-14 06:02:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:53,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:02:53,587 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 17 [2022-12-14 06:02:53,715 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3244 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_3244) |c_ULTIMATE.start_main_~#a~1#1.base|))) (= (select .cse0 (+ 8 (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (select .cse0 (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|)))))) is different from false [2022-12-14 06:02:53,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:53,834 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 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 06:02:53,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:53,852 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 203 treesize of output 203 [2022-12-14 06:02:53,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:53,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 150 treesize of output 134 [2022-12-14 06:02:53,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:02:53,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 134 treesize of output 102 [2022-12-14 06:02:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 06:02:53,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19232314] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:02:53,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1549909552] [2022-12-14 06:02:53,961 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:02:53,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:02:53,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-12-14 06:02:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162421676] [2022-12-14 06:02:53,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:02:53,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 06:02:53,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:02:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 06:02:53,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1213, Unknown=3, NotChecked=70, Total=1406 [2022-12-14 06:02:53,964 INFO L87 Difference]: Start difference. First operand 47688 states and 98638 transitions. Second operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 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:03:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:03:09,783 INFO L93 Difference]: Finished difference Result 93259 states and 192962 transitions. [2022-12-14 06:03:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 06:03:09,784 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 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 24 [2022-12-14 06:03:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:03:09,963 INFO L225 Difference]: With dead ends: 93259 [2022-12-14 06:03:09,964 INFO L226 Difference]: Without dead ends: 93259 [2022-12-14 06:03:09,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=305, Invalid=2146, Unknown=3, NotChecked=96, Total=2550 [2022-12-14 06:03:09,964 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 3927 mSDsluCounter, 11430 mSDsCounter, 0 mSdLazyCounter, 19342 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3927 SdHoareTripleChecker+Valid, 12119 SdHoareTripleChecker+Invalid, 20958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 19342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1584 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-12-14 06:03:09,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3927 Valid, 12119 Invalid, 20958 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 19342 Invalid, 0 Unknown, 1584 Unchecked, 14.8s Time] [2022-12-14 06:03:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93259 states. [2022-12-14 06:03:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93259 to 47727. [2022-12-14 06:03:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47727 states, 46385 states have (on average 2.1281879918076965) internal successors, (98716), 47726 states have internal predecessors, (98716), 0 states have call successors, (0), 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:03:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47727 states to 47727 states and 98716 transitions. [2022-12-14 06:03:10,913 INFO L78 Accepts]: Start accepts. Automaton has 47727 states and 98716 transitions. Word has length 24 [2022-12-14 06:03:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:03:10,913 INFO L495 AbstractCegarLoop]: Abstraction has 47727 states and 98716 transitions. [2022-12-14 06:03:10,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 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:03:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 47727 states and 98716 transitions. [2022-12-14 06:03:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:03:10,914 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:03:10,914 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] [2022-12-14 06:03:10,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 06:03:11,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:03:11,116 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:03:11,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:03:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1157635820, now seen corresponding path program 3 times [2022-12-14 06:03:11,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:03:11,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41667992] [2022-12-14 06:03:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:03:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:03:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:03:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:11,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:03:11,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41667992] [2022-12-14 06:03:11,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41667992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:03:11,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099641159] [2022-12-14 06:03:11,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:03:11,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:03:11,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:03:11,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:03:11,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 06:03:12,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:03:12,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:03:12,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-14 06:03:12,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:03:12,514 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:03:12,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-12-14 06:03:12,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-12-14 06:03:12,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:03:12,624 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 25 treesize of output 25 [2022-12-14 06:03:12,635 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 06:03:12,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 06:03:12,666 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 25 treesize of output 25 [2022-12-14 06:03:12,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:12,806 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 29 treesize of output 13 [2022-12-14 06:03:12,921 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 13 treesize of output 9 [2022-12-14 06:03:12,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:03:12,956 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 23 treesize of output 22 [2022-12-14 06:03:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:12,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:03:13,054 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 17 [2022-12-14 06:03:13,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:13,393 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 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 06:03:13,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:13,412 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 111 treesize of output 123 [2022-12-14 06:03:13,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:13,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 54 [2022-12-14 06:03:13,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:13,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 46 [2022-12-14 06:03:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:13,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099641159] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:03:13,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [210412729] [2022-12-14 06:03:13,529 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:03:13,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:03:13,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-12-14 06:03:13,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628037799] [2022-12-14 06:03:13,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:03:13,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 06:03:13,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:03:13,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 06:03:13,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1274, Unknown=7, NotChecked=0, Total=1406 [2022-12-14 06:03:13,531 INFO L87 Difference]: Start difference. First operand 47727 states and 98716 transitions. Second operand has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 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:03:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:03:28,280 INFO L93 Difference]: Finished difference Result 93269 states and 192982 transitions. [2022-12-14 06:03:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 06:03:28,280 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 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 24 [2022-12-14 06:03:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:03:28,448 INFO L225 Difference]: With dead ends: 93269 [2022-12-14 06:03:28,448 INFO L226 Difference]: Without dead ends: 93269 [2022-12-14 06:03:28,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=355, Invalid=2290, Unknown=7, NotChecked=0, Total=2652 [2022-12-14 06:03:28,449 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 2742 mSDsluCounter, 9179 mSDsCounter, 0 mSdLazyCounter, 16889 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2742 SdHoareTripleChecker+Valid, 9873 SdHoareTripleChecker+Invalid, 16934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 16889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:03:28,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2742 Valid, 9873 Invalid, 16934 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 16889 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2022-12-14 06:03:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93269 states. [2022-12-14 06:03:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93269 to 47721. [2022-12-14 06:03:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47721 states, 46379 states have (on average 2.128204575346601) internal successors, (98704), 47720 states have internal predecessors, (98704), 0 states have call successors, (0), 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:03:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47721 states to 47721 states and 98704 transitions. [2022-12-14 06:03:29,365 INFO L78 Accepts]: Start accepts. Automaton has 47721 states and 98704 transitions. Word has length 24 [2022-12-14 06:03:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:03:29,366 INFO L495 AbstractCegarLoop]: Abstraction has 47721 states and 98704 transitions. [2022-12-14 06:03:29,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 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:03:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 47721 states and 98704 transitions. [2022-12-14 06:03:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:03:29,366 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:03:29,367 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] [2022-12-14 06:03:29,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 06:03:29,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 06:03:29,568 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:03:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:03:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash 83635352, now seen corresponding path program 4 times [2022-12-14 06:03:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:03:29,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458247509] [2022-12-14 06:03:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:03:29,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:03:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:03:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:30,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:03:30,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458247509] [2022-12-14 06:03:30,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458247509] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:03:30,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651393937] [2022-12-14 06:03:30,291 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:03:30,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:03:30,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:03:30,292 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:03:30,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 06:03:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:03:30,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-14 06:03:30,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:03:30,492 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-14 06:03:30,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-12-14 06:03:30,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-12-14 06:03:30,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:03:30,627 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 25 treesize of output 25 [2022-12-14 06:03:30,642 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-14 06:03:30,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 06:03:30,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 06:03:30,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-14 06:03:30,940 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 13 treesize of output 9 [2022-12-14 06:03:30,976 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 16 treesize of output 18 [2022-12-14 06:03:31,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:03:31,048 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 23 treesize of output 22 [2022-12-14 06:03:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:31,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:03:31,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:31,251 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 27 treesize of output 28 [2022-12-14 06:03:31,253 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 48 treesize of output 42 [2022-12-14 06:03:31,256 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 32 treesize of output 28 [2022-12-14 06:03:31,259 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 50 treesize of output 38 [2022-12-14 06:03:31,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:31,696 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 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 06:03:31,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:31,713 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 203 treesize of output 203 [2022-12-14 06:03:31,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:31,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 150 treesize of output 134 [2022-12-14 06:03:31,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:31,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 134 treesize of output 102 [2022-12-14 06:03:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:31,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651393937] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:03:31,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [213082024] [2022-12-14 06:03:31,830 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:03:31,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:03:31,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-12-14 06:03:31,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809094635] [2022-12-14 06:03:31,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:03:31,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 06:03:31,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:03:31,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 06:03:31,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1470, Unknown=20, NotChecked=0, Total=1640 [2022-12-14 06:03:31,831 INFO L87 Difference]: Start difference. First operand 47721 states and 98704 transitions. Second operand has 41 states, 40 states have (on average 1.8) internal successors, (72), 40 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:03:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:03:44,757 INFO L93 Difference]: Finished difference Result 49708 states and 102750 transitions. [2022-12-14 06:03:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 06:03:44,757 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.8) internal successors, (72), 40 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 24 [2022-12-14 06:03:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:03:44,849 INFO L225 Difference]: With dead ends: 49708 [2022-12-14 06:03:44,849 INFO L226 Difference]: Without dead ends: 49708 [2022-12-14 06:03:44,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=395, Invalid=2555, Unknown=20, NotChecked=0, Total=2970 [2022-12-14 06:03:44,851 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 1292 mSDsluCounter, 6292 mSDsCounter, 0 mSdLazyCounter, 10945 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 6722 SdHoareTripleChecker+Invalid, 10999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 10945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-12-14 06:03:44,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 6722 Invalid, 10999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 10945 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2022-12-14 06:03:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49708 states. [2022-12-14 06:03:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49708 to 47713. [2022-12-14 06:03:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47713 states, 46371 states have (on average 2.128226693407518) internal successors, (98688), 47712 states have internal predecessors, (98688), 0 states have call successors, (0), 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:03:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47713 states to 47713 states and 98688 transitions. [2022-12-14 06:03:45,609 INFO L78 Accepts]: Start accepts. Automaton has 47713 states and 98688 transitions. Word has length 24 [2022-12-14 06:03:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:03:45,609 INFO L495 AbstractCegarLoop]: Abstraction has 47713 states and 98688 transitions. [2022-12-14 06:03:45,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.8) internal successors, (72), 40 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:03:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 47713 states and 98688 transitions. [2022-12-14 06:03:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:03:45,609 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:03:45,610 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] [2022-12-14 06:03:45,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 06:03:45,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 06:03:45,811 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:03:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:03:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1239447229, now seen corresponding path program 3 times [2022-12-14 06:03:45,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:03:45,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513948922] [2022-12-14 06:03:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:03:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:03:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:03:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:46,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:03:46,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513948922] [2022-12-14 06:03:46,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513948922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:03:46,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386973934] [2022-12-14 06:03:46,458 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:03:46,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:03:46,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:03:46,459 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:03:46,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 06:03:47,000 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:03:47,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:03:47,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 80 conjunts are in the unsatisfiable core [2022-12-14 06:03:47,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:03:47,015 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:03:47,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-12-14 06:03:47,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:03:47,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:03:47,149 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 25 treesize of output 25 [2022-12-14 06:03:47,159 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 06:03:47,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 06:03:47,203 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 25 treesize of output 25 [2022-12-14 06:03:47,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:47,365 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 29 treesize of output 13 [2022-12-14 06:03:47,457 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 13 treesize of output 9 [2022-12-14 06:03:47,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:03:47,495 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 21 treesize of output 20 [2022-12-14 06:03:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:47,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:03:47,644 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4023 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_4023) |c_ULTIMATE.start_main_~#a~1#1.base|))) (= (select .cse0 (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (select .cse0 (+ 8 (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)))))) is different from false [2022-12-14 06:03:47,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:47,781 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 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 06:03:47,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:47,801 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 203 treesize of output 203 [2022-12-14 06:03:47,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:47,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 150 treesize of output 134 [2022-12-14 06:03:47,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:03:47,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 134 treesize of output 102 [2022-12-14 06:03:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 06:03:47,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386973934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:03:47,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1793324316] [2022-12-14 06:03:47,922 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:03:47,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:03:47,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-12-14 06:03:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244143968] [2022-12-14 06:03:47,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:03:47,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 06:03:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:03:47,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 06:03:47,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1084, Unknown=2, NotChecked=66, Total=1260 [2022-12-14 06:03:47,924 INFO L87 Difference]: Start difference. First operand 47713 states and 98688 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 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:04:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:02,337 INFO L93 Difference]: Finished difference Result 93219 states and 192885 transitions. [2022-12-14 06:04:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 06:04:02,337 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 06:04:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:02,516 INFO L225 Difference]: With dead ends: 93219 [2022-12-14 06:04:02,516 INFO L226 Difference]: Without dead ends: 93219 [2022-12-14 06:04:02,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=311, Invalid=1947, Unknown=2, NotChecked=92, Total=2352 [2022-12-14 06:04:02,517 INFO L413 NwaCegarLoop]: 671 mSDtfsCounter, 3072 mSDsluCounter, 9514 mSDsCounter, 0 mSdLazyCounter, 15012 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3072 SdHoareTripleChecker+Valid, 10185 SdHoareTripleChecker+Invalid, 16277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 15012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1229 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:02,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3072 Valid, 10185 Invalid, 16277 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 15012 Invalid, 0 Unknown, 1229 Unchecked, 13.3s Time] [2022-12-14 06:04:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93219 states. [2022-12-14 06:04:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93219 to 47728. [2022-12-14 06:04:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47728 states, 46386 states have (on average 2.1281852283016427) internal successors, (98718), 47727 states have internal predecessors, (98718), 0 states have call successors, (0), 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:04:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47728 states to 47728 states and 98718 transitions. [2022-12-14 06:04:03,472 INFO L78 Accepts]: Start accepts. Automaton has 47728 states and 98718 transitions. Word has length 24 [2022-12-14 06:04:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:03,472 INFO L495 AbstractCegarLoop]: Abstraction has 47728 states and 98718 transitions. [2022-12-14 06:04:03,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 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:04:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 47728 states and 98718 transitions. [2022-12-14 06:04:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:04:03,473 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:03,473 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] [2022-12-14 06:04:03,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 06:04:03,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:04:03,674 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:04:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:03,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1239787438, now seen corresponding path program 5 times [2022-12-14 06:04:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:03,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421500073] [2022-12-14 06:04:03,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:03,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:04:04,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:04,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421500073] [2022-12-14 06:04:04,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421500073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:04:04,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496457260] [2022-12-14 06:04:04,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:04:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:04:04,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:04:04,267 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:04:04,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 06:04:04,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:04:04,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:04:04,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-14 06:04:04,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:04:04,673 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:04:04,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-12-14 06:04:04,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:04:04,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:04:04,797 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 25 treesize of output 25 [2022-12-14 06:04:04,805 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 06:04:04,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 06:04:04,843 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 25 treesize of output 25 [2022-12-14 06:04:05,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:05,011 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 29 treesize of output 13 [2022-12-14 06:04:05,115 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 13 treesize of output 9 [2022-12-14 06:04:05,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:04:05,150 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 23 treesize of output 22 [2022-12-14 06:04:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:04:05,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:04:05,326 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4282 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_4282) |c_ULTIMATE.start_main_~#a~1#1.base|))) (= (select .cse0 (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (select .cse0 (+ 8 (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)))))) is different from false [2022-12-14 06:04:05,446 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:05,446 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 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 06:04:05,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:05,464 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 203 treesize of output 203 [2022-12-14 06:04:05,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:05,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 150 treesize of output 134 [2022-12-14 06:04:05,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:05,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 134 treesize of output 102 [2022-12-14 06:04:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 06:04:05,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496457260] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:04:05,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1116674339] [2022-12-14 06:04:05,568 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:04:05,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:04:05,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-12-14 06:04:05,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970413494] [2022-12-14 06:04:05,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:04:05,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 06:04:05,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:05,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 06:04:05,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1020, Unknown=2, NotChecked=64, Total=1190 [2022-12-14 06:04:05,569 INFO L87 Difference]: Start difference. First operand 47728 states and 98718 transitions. Second operand has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 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:04:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:21,630 INFO L93 Difference]: Finished difference Result 93215 states and 192877 transitions. [2022-12-14 06:04:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 06:04:21,630 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 06:04:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:21,807 INFO L225 Difference]: With dead ends: 93215 [2022-12-14 06:04:21,807 INFO L226 Difference]: Without dead ends: 93215 [2022-12-14 06:04:21,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=279, Invalid=1703, Unknown=2, NotChecked=86, Total=2070 [2022-12-14 06:04:21,808 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 1849 mSDsluCounter, 9382 mSDsCounter, 0 mSdLazyCounter, 18878 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 10060 SdHoareTripleChecker+Invalid, 20251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 18878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1349 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:21,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1849 Valid, 10060 Invalid, 20251 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 18878 Invalid, 0 Unknown, 1349 Unchecked, 15.0s Time] [2022-12-14 06:04:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93215 states. [2022-12-14 06:04:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93215 to 47724. [2022-12-14 06:04:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47724 states, 46382 states have (on average 2.1281962830408347) internal successors, (98710), 47723 states have internal predecessors, (98710), 0 states have call successors, (0), 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:04:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47724 states to 47724 states and 98710 transitions. [2022-12-14 06:04:22,770 INFO L78 Accepts]: Start accepts. Automaton has 47724 states and 98710 transitions. Word has length 24 [2022-12-14 06:04:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:22,770 INFO L495 AbstractCegarLoop]: Abstraction has 47724 states and 98710 transitions. [2022-12-14 06:04:22,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 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:04:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 47724 states and 98710 transitions. [2022-12-14 06:04:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:04:22,771 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:22,771 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] [2022-12-14 06:04:22,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 06:04:22,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 06:04:22,972 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:04:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2122425805, now seen corresponding path program 4 times [2022-12-14 06:04:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:22,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093610522] [2022-12-14 06:04:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:04:23,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:23,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093610522] [2022-12-14 06:04:23,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093610522] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:04:23,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555637079] [2022-12-14 06:04:23,706 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 06:04:23,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:04:23,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:04:23,707 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:04:23,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 06:04:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:23,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-14 06:04:23,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:04:23,971 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-14 06:04:23,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-12-14 06:04:24,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-12-14 06:04:24,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:04:24,134 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 25 treesize of output 25 [2022-12-14 06:04:24,153 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-14 06:04:24,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 06:04:24,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 06:04:24,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-14 06:04:24,482 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 13 treesize of output 9 [2022-12-14 06:04:24,514 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 16 treesize of output 18 [2022-12-14 06:04:24,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:04:24,581 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 21 treesize of output 20 [2022-12-14 06:04:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:04:24,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:04:24,661 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4544 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| v_ArrVal_4544) |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |c_ULTIMATE.start_worker_fn_~tid~0#1|)) |c_ULTIMATE.start_worker_fn_#t~nondet18#1|)) (not (= |c_worker_fnThread1of1ForFork0_#t~mem17#1| |c_ULTIMATE.start_worker_fn_~tid~0#1|))) is different from false [2022-12-14 06:04:24,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:24,666 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 22 treesize of output 23 [2022-12-14 06:04:24,668 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 22 treesize of output 16 [2022-12-14 06:04:25,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:25,026 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 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 06:04:25,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:25,041 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 111 treesize of output 123 [2022-12-14 06:04:25,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:25,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 54 [2022-12-14 06:04:25,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:25,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 46 [2022-12-14 06:04:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:04:25,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555637079] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:04:25,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1548661999] [2022-12-14 06:04:25,151 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:04:25,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:04:25,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-12-14 06:04:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761256360] [2022-12-14 06:04:25,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:04:25,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 06:04:25,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 06:04:25,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1275, Unknown=2, NotChecked=72, Total=1482 [2022-12-14 06:04:25,152 INFO L87 Difference]: Start difference. First operand 47724 states and 98710 transitions. Second operand has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 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:04:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:38,314 INFO L93 Difference]: Finished difference Result 49644 states and 102625 transitions. [2022-12-14 06:04:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 06:04:38,315 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 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 24 [2022-12-14 06:04:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:38,406 INFO L225 Difference]: With dead ends: 49644 [2022-12-14 06:04:38,406 INFO L226 Difference]: Without dead ends: 49644 [2022-12-14 06:04:38,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=383, Invalid=2271, Unknown=2, NotChecked=100, Total=2756 [2022-12-14 06:04:38,407 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 1360 mSDsluCounter, 6822 mSDsCounter, 0 mSdLazyCounter, 11449 mSolverCounterSat, 54 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 7235 SdHoareTripleChecker+Invalid, 12192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 11449 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 680 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:38,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 7235 Invalid, 12192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 11449 Invalid, 9 Unknown, 680 Unchecked, 12.0s Time] [2022-12-14 06:04:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49644 states. [2022-12-14 06:04:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49644 to 47728. [2022-12-14 06:04:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47728 states, 46386 states have (on average 2.1281852283016427) internal successors, (98718), 47727 states have internal predecessors, (98718), 0 states have call successors, (0), 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:04:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47728 states to 47728 states and 98718 transitions. [2022-12-14 06:04:39,106 INFO L78 Accepts]: Start accepts. Automaton has 47728 states and 98718 transitions. Word has length 24 [2022-12-14 06:04:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:39,106 INFO L495 AbstractCegarLoop]: Abstraction has 47728 states and 98718 transitions. [2022-12-14 06:04:39,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 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:04:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 47728 states and 98718 transitions. [2022-12-14 06:04:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:04:39,107 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:39,107 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] [2022-12-14 06:04:39,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 06:04:39,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 06:04:39,308 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:04:39,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash -131363089, now seen corresponding path program 5 times [2022-12-14 06:04:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:39,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593277738] [2022-12-14 06:04:39,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:04:39,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:39,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593277738] [2022-12-14 06:04:39,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593277738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:04:39,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694492102] [2022-12-14 06:04:39,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:04:39,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:04:39,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:04:39,924 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:04:39,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 06:04:40,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:04:40,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:04:40,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-14 06:04:40,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:04:40,735 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:04:40,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-12-14 06:04:40,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:04:40,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:04:40,860 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 06:04:40,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-12-14 06:04:40,865 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 25 treesize of output 25 [2022-12-14 06:04:40,904 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 25 treesize of output 25 [2022-12-14 06:04:41,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:41,016 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 29 treesize of output 13 [2022-12-14 06:04:41,117 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 13 treesize of output 9 [2022-12-14 06:04:41,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:04:41,150 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 21 treesize of output 20 [2022-12-14 06:04:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:04:41,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:04:41,217 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 17 [2022-12-14 06:04:41,335 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4801 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#a~1#1.base|))) (= (select .cse0 (+ 8 (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (select .cse0 (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|)))))) is different from false [2022-12-14 06:04:41,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:41,469 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 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 06:04:41,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:41,489 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 203 treesize of output 203 [2022-12-14 06:04:41,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:41,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 150 treesize of output 134 [2022-12-14 06:04:41,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:04:41,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 134 treesize of output 102 [2022-12-14 06:04:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 06:04:41,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694492102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:04:41,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2066209942] [2022-12-14 06:04:41,613 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:04:41,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:04:41,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-12-14 06:04:41,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189184181] [2022-12-14 06:04:41,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:04:41,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 06:04:41,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:41,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 06:04:41,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1212, Unknown=2, NotChecked=70, Total=1406 [2022-12-14 06:04:41,615 INFO L87 Difference]: Start difference. First operand 47728 states and 98718 transitions. Second operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 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:05:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:05:00,976 INFO L93 Difference]: Finished difference Result 93063 states and 192565 transitions. [2022-12-14 06:05:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 06:05:00,976 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 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 24 [2022-12-14 06:05:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:05:01,154 INFO L225 Difference]: With dead ends: 93063 [2022-12-14 06:05:01,154 INFO L226 Difference]: Without dead ends: 93063 [2022-12-14 06:05:01,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=294, Invalid=1964, Unknown=2, NotChecked=92, Total=2352 [2022-12-14 06:05:01,155 INFO L413 NwaCegarLoop]: 669 mSDtfsCounter, 3319 mSDsluCounter, 12168 mSDsCounter, 0 mSdLazyCounter, 21510 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 12837 SdHoareTripleChecker+Invalid, 23054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 21510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1512 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:05:01,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 12837 Invalid, 23054 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 21510 Invalid, 0 Unknown, 1512 Unchecked, 18.3s Time] [2022-12-14 06:05:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93063 states. [2022-12-14 06:05:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93063 to 47732. [2022-12-14 06:05:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47732 states, 46390 states have (on average 2.128174175468851) internal successors, (98726), 47731 states have internal predecessors, (98726), 0 states have call successors, (0), 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:05:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47732 states to 47732 states and 98726 transitions. [2022-12-14 06:05:02,185 INFO L78 Accepts]: Start accepts. Automaton has 47732 states and 98726 transitions. Word has length 24 [2022-12-14 06:05:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:05:02,185 INFO L495 AbstractCegarLoop]: Abstraction has 47732 states and 98726 transitions. [2022-12-14 06:05:02,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 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:05:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 47732 states and 98726 transitions. [2022-12-14 06:05:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 06:05:02,186 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:05:02,186 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] [2022-12-14 06:05:02,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 06:05:02,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:05:02,388 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-12-14 06:05:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:05:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -131703298, now seen corresponding path program 6 times [2022-12-14 06:05:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:05:02,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710146405] [2022-12-14 06:05:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:05:02,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:05:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:05:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:05:03,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:05:03,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710146405] [2022-12-14 06:05:03,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710146405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:05:03,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196000751] [2022-12-14 06:05:03,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 06:05:03,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:05:03,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:05:03,084 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:05:03,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30dc2e63-185e-41c6-ba3f-693f89533f1a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 06:05:03,859 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 06:05:03,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:05:03,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-14 06:05:03,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:05:03,879 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:05:03,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-12-14 06:05:03,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:05:03,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2022-12-14 06:05:04,008 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 25 treesize of output 25 [2022-12-14 06:05:04,022 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 06:05:04,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 06:05:04,063 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 25 treesize of output 25 [2022-12-14 06:05:04,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:05:04,160 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 29 treesize of output 13 [2022-12-14 06:05:04,268 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 13 treesize of output 9 [2022-12-14 06:05:04,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:05:04,305 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 23 treesize of output 22 [2022-12-14 06:05:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:05:04,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:05:04,394 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 17 [2022-12-14 06:05:04,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:05:04,714 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 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 06:05:04,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:05:04,732 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 111 treesize of output 123 [2022-12-14 06:05:04,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:05:04,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 54 [2022-12-14 06:05:04,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:05:04,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 46 [2022-12-14 06:05:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:05:04,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196000751] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:05:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [757334184] [2022-12-14 06:05:04,822 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:05:04,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:05:04,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37 [2022-12-14 06:05:04,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774196344] [2022-12-14 06:05:04,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:05:04,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 06:05:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:05:04,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 06:05:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1342, Unknown=9, NotChecked=0, Total=1482 [2022-12-14 06:05:04,824 INFO L87 Difference]: Start difference. First operand 47732 states and 98726 transitions. Second operand has 39 states, 38 states have (on average 1.894736842105263) internal successors, (72), 38 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)