./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/barrier_2t.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/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 f16bd48636db1837ea8e0ca595ad8610f40d584c5526c4d4feced86ef6fdf308 --- 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 10:30:01,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:30:01,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:30:01,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:30:01,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:30:01,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:30:01,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:30:01,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:30:01,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:30:01,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:30:01,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:30:01,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:30:01,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:30:01,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:30:01,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:30:01,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:30:01,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:30:01,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:30:01,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:30:01,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:30:01,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:30:01,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:30:01,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:30:01,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:30:01,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:30:01,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:30:01,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:30:01,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:30:01,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:30:01,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:30:01,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:30:01,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:30:01,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:30:01,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:30:01,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:30:01,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:30:01,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:30:01,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:30:01,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:30:01,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:30:01,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:30:01,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-12-14 10:30:01,816 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:30:01,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:30:01,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:30:01,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:30:01,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:30:01,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:30:01,817 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:30:01,817 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:30:01,817 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:30:01,817 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:30:01,818 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:30:01,818 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:30:01,818 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:30:01,818 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:30:01,818 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:30:01,819 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:30:01,819 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:30:01,819 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:30:01,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:30:01,819 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:30:01,820 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 10:30:01,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:30:01,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:30:01,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:30:01,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 10:30:01,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:30:01,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 10:30:01,820 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-14 10:30:01,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:30:01,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 10:30:01,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:30:01,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 10:30:01,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:30:01,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:30:01,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:30:01,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:30:01,822 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:30:01,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:30:01,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 10:30:01,822 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:30:01,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:30:01,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 10:30:01,822 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:30:01,823 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/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 -> f16bd48636db1837ea8e0ca595ad8610f40d584c5526c4d4feced86ef6fdf308 [2022-12-14 10:30:02,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:30:02,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:30:02,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:30:02,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:30:02,058 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:30:02,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-divine/barrier_2t.i [2022-12-14 10:30:04,677 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:30:04,873 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:30:04,873 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i [2022-12-14 10:30:04,884 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/data/dd823464f/4944b6d86b91437f8466aeded2baee53/FLAG695c0618f [2022-12-14 10:30:04,896 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/data/dd823464f/4944b6d86b91437f8466aeded2baee53 [2022-12-14 10:30:04,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:30:04,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:30:04,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:30:04,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:30:04,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:30:04,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:30:04" (1/1) ... [2022-12-14 10:30:04,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34242dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:04, skipping insertion in model container [2022-12-14 10:30:04,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:30:04" (1/1) ... [2022-12-14 10:30:04,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:30:04,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:30:05,059 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 10:30:05,204 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[30484,30497] [2022-12-14 10:30:05,235 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[31858,31871] [2022-12-14 10:30:05,236 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[31909,31922] [2022-12-14 10:30:05,238 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32058,32071] [2022-12-14 10:30:05,239 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32135,32148] [2022-12-14 10:30:05,240 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32182,32195] [2022-12-14 10:30:05,242 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32291,32304] [2022-12-14 10:30:05,244 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32410,32423] [2022-12-14 10:30:05,245 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32458,32471] [2022-12-14 10:30:05,246 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32535,32548] [2022-12-14 10:30:05,248 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32661,32674] [2022-12-14 10:30:05,257 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[33244,33257] [2022-12-14 10:30:05,258 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[33321,33334] [2022-12-14 10:30:05,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:30:05,271 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:30:05,281 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 10:30:05,303 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[30484,30497] [2022-12-14 10:30:05,318 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[31858,31871] [2022-12-14 10:30:05,319 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[31909,31922] [2022-12-14 10:30:05,321 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32058,32071] [2022-12-14 10:30:05,322 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32135,32148] [2022-12-14 10:30:05,323 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32182,32195] [2022-12-14 10:30:05,325 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32291,32304] [2022-12-14 10:30:05,327 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32410,32423] [2022-12-14 10:30:05,328 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32458,32471] [2022-12-14 10:30:05,329 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32535,32548] [2022-12-14 10:30:05,330 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[32661,32674] [2022-12-14 10:30:05,338 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[33244,33257] [2022-12-14 10:30:05,339 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_ed769796-53ba-41d0-9bb3-df8d7bd5d240/sv-benchmarks/c/pthread-divine/barrier_2t.i[33321,33334] [2022-12-14 10:30:05,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:30:05,368 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:30:05,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05 WrapperNode [2022-12-14 10:30:05,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:30:05,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:30:05,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:30:05,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:30:05,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,448 INFO L138 Inliner]: procedures = 174, calls = 78, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 950 [2022-12-14 10:30:05,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:30:05,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:30:05,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:30:05,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:30:05,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,542 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:30:05,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:30:05,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:30:05,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:30:05,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (1/1) ... [2022-12-14 10:30:05,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:30:05,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:30:05,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:30:05,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:30:05,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 10:30:05,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 10:30:05,633 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 10:30:05,633 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-12-14 10:30:05,633 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-12-14 10:30:05,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:30:05,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 10:30:05,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 10:30:05,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 10:30:05,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 10:30:05,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 10:30:05,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:30:05,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:30:05,636 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 10:30:05,774 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:30:05,776 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:30:06,679 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:30:06,693 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:30:06,694 INFO L300 CfgBuilder]: Removed 20 assume(true) statements. [2022-12-14 10:30:06,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:30:06 BoogieIcfgContainer [2022-12-14 10:30:06,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:30:06,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:30:06,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:30:06,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:30:06,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:30:04" (1/3) ... [2022-12-14 10:30:06,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc7f938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:30:06, skipping insertion in model container [2022-12-14 10:30:06,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:30:05" (2/3) ... [2022-12-14 10:30:06,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc7f938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:30:06, skipping insertion in model container [2022-12-14 10:30:06,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:30:06" (3/3) ... [2022-12-14 10:30:06,706 INFO L112 eAbstractionObserver]: Analyzing ICFG barrier_2t.i [2022-12-14 10:30:06,714 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 10:30:06,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:30:06,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2022-12-14 10:30:06,723 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 10:30:06,832 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-14 10:30:06,864 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 10:30:06,875 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1018 places, 1085 transitions, 2178 flow [2022-12-14 10:30:06,877 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 1018 places, 1085 transitions, 2178 flow [2022-12-14 10:30:06,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1018 places, 1085 transitions, 2178 flow [2022-12-14 10:30:07,475 INFO L130 PetriNetUnfolder]: 106/1593 cut-off events. [2022-12-14 10:30:07,475 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-14 10:30:07,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 1593 events. 106/1593 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 6061 event pairs, 0 based on Foata normal form. 0/1339 useless extension candidates. Maximal degree in co-relation 964. Up to 4 conditions per place. [2022-12-14 10:30:07,589 INFO L119 LiptonReduction]: Number of co-enabled transitions 463628 [2022-12-14 10:33:59,089 WARN L233 SmtUtils]: Spent 9.49s on a formula simplification. DAG size of input: 119 DAG size of output: 117 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 10:34:13,050 WARN L233 SmtUtils]: Spent 11.11s on a formula simplification. DAG size of input: 125 DAG size of output: 123 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 10:34:45,337 WARN L233 SmtUtils]: Spent 18.32s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 10:34:58,986 WARN L233 SmtUtils]: Spent 13.65s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 10:35:19,667 WARN L233 SmtUtils]: Spent 20.68s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 10:35:32,854 WARN L233 SmtUtils]: Spent 13.19s on a formula simplification that was a NOOP. DAG size: 159 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-14 10:35:32,887 INFO L134 LiptonReduction]: Checked pairs total: 2607735 [2022-12-14 10:35:32,887 INFO L136 LiptonReduction]: Total number of compositions: 703 [2022-12-14 10:35:32,893 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 542 places, 589 transitions, 1186 flow [2022-12-14 10:35:33,937 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70425 states, 68121 states have (on average 2.2425977305089475) internal successors, (152768), 70424 states have internal predecessors, (152768), 0 states have call successors, (0), 0 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 10:35:33,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:35:33,956 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;@2e4b5c02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:35:33,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 143 error locations. [2022-12-14 10:35:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 70425 states, 68121 states have (on average 2.2425977305089475) internal successors, (152768), 70424 states have internal predecessors, (152768), 0 states have call successors, (0), 0 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 10:35:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 10:35:34,032 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:35:34,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 10:35:34,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:35:34,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:35:34,039 INFO L85 PathProgramCache]: Analyzing trace with hash 116968, now seen corresponding path program 1 times [2022-12-14 10:35:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:35:34,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800030138] [2022-12-14 10:35:34,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:35:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:35:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:35:34,173 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 10:35:34,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:35:34,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800030138] [2022-12-14 10:35:34,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800030138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:35:34,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:35:34,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:35:34,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386122658] [2022-12-14 10:35:34,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:35:34,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 10:35:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:35:34,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 10:35:34,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 10:35:34,278 INFO L87 Difference]: Start difference. First operand has 70425 states, 68121 states have (on average 2.2425977305089475) internal successors, (152768), 70424 states have internal predecessors, (152768), 0 states have call successors, (0), 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 10:35:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:35:35,362 INFO L93 Difference]: Finished difference Result 70418 states and 146663 transitions. [2022-12-14 10:35:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 10:35:35,364 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 10:35:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:35:35,624 INFO L225 Difference]: With dead ends: 70418 [2022-12-14 10:35:35,624 INFO L226 Difference]: Without dead ends: 70416 [2022-12-14 10:35:35,625 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 10:35:35,627 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:35:35,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 10:35:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70416 states. [2022-12-14 10:35:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70416 to 70416. [2022-12-14 10:35:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70416 states, 68121 states have (on average 2.152933750238546) internal successors, (146660), 70415 states have internal predecessors, (146660), 0 states have call successors, (0), 0 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 10:35:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70416 states to 70416 states and 146660 transitions. [2022-12-14 10:35:37,131 INFO L78 Accepts]: Start accepts. Automaton has 70416 states and 146660 transitions. Word has length 2 [2022-12-14 10:35:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:35:37,131 INFO L495 AbstractCegarLoop]: Abstraction has 70416 states and 146660 transitions. [2022-12-14 10:35:37,132 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 10:35:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 70416 states and 146660 transitions. [2022-12-14 10:35:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:35:37,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:35:37,132 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-14 10:35:37,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:35:37,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:35:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:35:37,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1923694391, now seen corresponding path program 1 times [2022-12-14 10:35:37,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:35:37,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431252869] [2022-12-14 10:35:37,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:35:37,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:35:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:35:37,242 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 10:35:37,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:35:37,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431252869] [2022-12-14 10:35:37,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431252869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:35:37,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:35:37,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:35:37,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148191318] [2022-12-14 10:35:37,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:35:37,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:35:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:35:37,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:35:37,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:35:37,245 INFO L87 Difference]: Start difference. First operand 70416 states and 146660 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 10:35:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:35:38,659 INFO L93 Difference]: Finished difference Result 70417 states and 146661 transitions. [2022-12-14 10:35:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:35:38,659 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 10:35:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:35:38,796 INFO L225 Difference]: With dead ends: 70417 [2022-12-14 10:35:38,796 INFO L226 Difference]: Without dead ends: 70417 [2022-12-14 10:35:38,796 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 10:35:38,798 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:35:38,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 10:35:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70417 states. [2022-12-14 10:35:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70417 to 70417. [2022-12-14 10:35:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70417 states, 68122 states have (on average 2.1529168256950766) internal successors, (146661), 70416 states have internal predecessors, (146661), 0 states have call successors, (0), 0 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 10:35:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70417 states to 70417 states and 146661 transitions. [2022-12-14 10:35:40,100 INFO L78 Accepts]: Start accepts. Automaton has 70417 states and 146661 transitions. Word has length 7 [2022-12-14 10:35:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:35:40,101 INFO L495 AbstractCegarLoop]: Abstraction has 70417 states and 146661 transitions. [2022-12-14 10:35:40,101 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 10:35:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 70417 states and 146661 transitions. [2022-12-14 10:35:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 10:35:40,102 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:35:40,102 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 10:35:40,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 10:35:40,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:35:40,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:35:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1693447339, now seen corresponding path program 1 times [2022-12-14 10:35:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:35:40,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407869060] [2022-12-14 10:35:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:35:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:35:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:35:40,238 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 10:35:40,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:35:40,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407869060] [2022-12-14 10:35:40,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407869060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:35:40,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117758486] [2022-12-14 10:35:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:35:40,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:35:40,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:35:40,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:35:40,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 10:35:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:35:40,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 10:35:40,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:35:40,411 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 10:35:40,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:35:40,424 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 10:35:40,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117758486] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:35:40,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1831260379] [2022-12-14 10:35:40,430 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 10:35:40,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:35:40,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-14 10:35:40,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538672834] [2022-12-14 10:35:40,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:35:40,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:35:40,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:35:40,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:35:40,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:35:40,433 INFO L87 Difference]: Start difference. First operand 70417 states and 146661 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 10:35:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:35:41,988 INFO L93 Difference]: Finished difference Result 70418 states and 146662 transitions. [2022-12-14 10:35:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:35:41,988 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 10:35:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:35:42,210 INFO L225 Difference]: With dead ends: 70418 [2022-12-14 10:35:42,210 INFO L226 Difference]: Without dead ends: 70418 [2022-12-14 10:35:42,210 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 10:35:42,211 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 0 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:35:42,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1035 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 10:35:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70418 states. [2022-12-14 10:35:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70418 to 70418. [2022-12-14 10:35:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70418 states, 68123 states have (on average 2.152899901648489) internal successors, (146662), 70417 states have internal predecessors, (146662), 0 states have call successors, (0), 0 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 10:35:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70418 states to 70418 states and 146662 transitions. [2022-12-14 10:35:43,464 INFO L78 Accepts]: Start accepts. Automaton has 70418 states and 146662 transitions. Word has length 8 [2022-12-14 10:35:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:35:43,464 INFO L495 AbstractCegarLoop]: Abstraction has 70418 states and 146662 transitions. [2022-12-14 10:35:43,465 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 10:35:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 70418 states and 146662 transitions. [2022-12-14 10:35:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:35:43,465 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:35:43,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-12-14 10:35:43,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:35:43,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:35:43,668 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:35:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:35:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2139276023, now seen corresponding path program 2 times [2022-12-14 10:35:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:35:43,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274186982] [2022-12-14 10:35:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:35:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:35:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:35:43,748 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 10:35:43,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:35:43,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274186982] [2022-12-14 10:35:43,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274186982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:35:43,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065931243] [2022-12-14 10:35:43,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:35:43,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:35:43,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:35:43,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:35:43,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 10:35:44,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:35:44,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:35:44,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 10:35:44,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:35:44,375 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 10:35:44,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:35:44,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065931243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:35:44,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:35:44,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-14 10:35:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551255737] [2022-12-14 10:35:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:35:44,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:35:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:35:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:35:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:35:44,377 INFO L87 Difference]: Start difference. First operand 70418 states and 146662 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 10:35:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:35:45,448 INFO L93 Difference]: Finished difference Result 69906 states and 145616 transitions. [2022-12-14 10:35:45,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:35:45,448 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 10:35:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:35:45,599 INFO L225 Difference]: With dead ends: 69906 [2022-12-14 10:35:45,600 INFO L226 Difference]: Without dead ends: 69906 [2022-12-14 10:35:45,600 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 10:35:45,601 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 1103 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 10:35:45,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 682 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 10:35:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69906 states. [2022-12-14 10:35:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69906 to 69906. [2022-12-14 10:35:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69906 states, 67656 states have (on average 2.152299869930235) internal successors, (145616), 69905 states have internal predecessors, (145616), 0 states have call successors, (0), 0 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 10:35:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69906 states to 69906 states and 145616 transitions. [2022-12-14 10:35:46,747 INFO L78 Accepts]: Start accepts. Automaton has 69906 states and 145616 transitions. Word has length 9 [2022-12-14 10:35:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:35:46,747 INFO L495 AbstractCegarLoop]: Abstraction has 69906 states and 145616 transitions. [2022-12-14 10:35:46,747 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 10:35:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 69906 states and 145616 transitions. [2022-12-14 10:35:46,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:35:46,748 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:35:46,748 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:35:46,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 10:35:46,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:35:46,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:35:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:35:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash 302505360, now seen corresponding path program 1 times [2022-12-14 10:35:46,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:35:46,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235936858] [2022-12-14 10:35:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:35:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:35:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:35:47,182 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 10:35:47,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:35:47,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235936858] [2022-12-14 10:35:47,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235936858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:35:47,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:35:47,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:35:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441752968] [2022-12-14 10:35:47,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:35:47,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:35:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:35:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:35:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:35:47,184 INFO L87 Difference]: Start difference. First operand 69906 states and 145616 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 10:35:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:35:48,080 INFO L93 Difference]: Finished difference Result 69653 states and 145350 transitions. [2022-12-14 10:35:48,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:35:48,081 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 10:35:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:35:48,244 INFO L225 Difference]: With dead ends: 69653 [2022-12-14 10:35:48,244 INFO L226 Difference]: Without dead ends: 69653 [2022-12-14 10:35:48,244 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 10:35:48,245 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 269 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:35:48,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 688 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 10:35:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69653 states. [2022-12-14 10:35:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69653 to 69653. [2022-12-14 10:35:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69653 states, 67447 states have (on average 2.1550254273726037) internal successors, (145350), 69652 states have internal predecessors, (145350), 0 states have call successors, (0), 0 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 10:35:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69653 states to 69653 states and 145350 transitions. [2022-12-14 10:35:49,599 INFO L78 Accepts]: Start accepts. Automaton has 69653 states and 145350 transitions. Word has length 10 [2022-12-14 10:35:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:35:49,600 INFO L495 AbstractCegarLoop]: Abstraction has 69653 states and 145350 transitions. [2022-12-14 10:35:49,600 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 10:35:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 69653 states and 145350 transitions. [2022-12-14 10:35:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:35:49,600 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:35:49,600 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:35:49,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 10:35:49,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:35:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:35:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash 368317840, now seen corresponding path program 1 times [2022-12-14 10:35:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:35:49,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643829960] [2022-12-14 10:35:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:35:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:35:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:35:49,921 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 10:35:49,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:35:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643829960] [2022-12-14 10:35:49,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643829960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:35:49,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:35:49,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:35:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381107656] [2022-12-14 10:35:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:35:49,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:35:49,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:35:49,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:35:49,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:35:49,923 INFO L87 Difference]: Start difference. First operand 69653 states and 145350 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 10:35:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:35:54,069 INFO L93 Difference]: Finished difference Result 71215 states and 148546 transitions. [2022-12-14 10:35:54,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:35:54,069 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 10:35:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:35:54,205 INFO L225 Difference]: With dead ends: 71215 [2022-12-14 10:35:54,205 INFO L226 Difference]: Without dead ends: 71215 [2022-12-14 10:35:54,205 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 10:35:54,206 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 688 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4248 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 4538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 4248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:35:54,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 581 Invalid, 4538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 4248 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-12-14 10:35:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71215 states. [2022-12-14 10:35:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71215 to 70691. [2022-12-14 10:35:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70691 states, 68486 states have (on average 2.153345209239845) internal successors, (147474), 70690 states have internal predecessors, (147474), 0 states have call successors, (0), 0 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 10:35:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70691 states to 70691 states and 147474 transitions. [2022-12-14 10:35:55,493 INFO L78 Accepts]: Start accepts. Automaton has 70691 states and 147474 transitions. Word has length 12 [2022-12-14 10:35:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:35:55,494 INFO L495 AbstractCegarLoop]: Abstraction has 70691 states and 147474 transitions. [2022-12-14 10:35:55,494 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 10:35:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 70691 states and 147474 transitions. [2022-12-14 10:35:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:35:55,495 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:35:55,495 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:35:55,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 10:35:55,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:35:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:35:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1369393447, now seen corresponding path program 1 times [2022-12-14 10:35:55,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:35:55,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690426791] [2022-12-14 10:35:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:35:55,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:35:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:35:55,822 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 10:35:55,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:35:55,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690426791] [2022-12-14 10:35:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690426791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:35:55,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:35:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:35:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814235594] [2022-12-14 10:35:55,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:35:55,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:35:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:35:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:35:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:35:55,823 INFO L87 Difference]: Start difference. First operand 70691 states and 147474 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 10:35:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:35:59,191 INFO L93 Difference]: Finished difference Result 72165 states and 150488 transitions. [2022-12-14 10:35:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:35:59,192 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 10:35:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:35:59,357 INFO L225 Difference]: With dead ends: 72165 [2022-12-14 10:35:59,358 INFO L226 Difference]: Without dead ends: 72165 [2022-12-14 10:35:59,358 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 10:35:59,359 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 640 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 3403 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 3669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 3403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:35:59,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 563 Invalid, 3669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 3403 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 10:35:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72165 states. [2022-12-14 10:36:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72165 to 71671. [2022-12-14 10:36:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71671 states, 69466 states have (on average 2.1518152765381626) internal successors, (149478), 71670 states have internal predecessors, (149478), 0 states have call successors, (0), 0 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 10:36:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71671 states to 71671 states and 149478 transitions. [2022-12-14 10:36:00,617 INFO L78 Accepts]: Start accepts. Automaton has 71671 states and 149478 transitions. Word has length 13 [2022-12-14 10:36:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:36:00,617 INFO L495 AbstractCegarLoop]: Abstraction has 71671 states and 149478 transitions. [2022-12-14 10:36:00,617 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 10:36:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 71671 states and 149478 transitions. [2022-12-14 10:36:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:36:00,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:36:00,618 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:36:00,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 10:36:00,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:36:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:36:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1060363381, now seen corresponding path program 1 times [2022-12-14 10:36:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:36:00,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547118002] [2022-12-14 10:36:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:36:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:36:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:36:00,728 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 10:36:00,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:36:00,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547118002] [2022-12-14 10:36:00,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547118002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:36:00,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:36:00,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:36:00,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601293230] [2022-12-14 10:36:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:36:00,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:36:00,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:36:00,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:36:00,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:36:00,729 INFO L87 Difference]: Start difference. First operand 71671 states and 149478 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 10:36:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:36:02,174 INFO L93 Difference]: Finished difference Result 71935 states and 150018 transitions. [2022-12-14 10:36:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:36:02,175 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 10:36:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:36:02,339 INFO L225 Difference]: With dead ends: 71935 [2022-12-14 10:36:02,339 INFO L226 Difference]: Without dead ends: 71935 [2022-12-14 10:36:02,339 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 10:36:02,340 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 171 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:36:02,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 394 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 10:36:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71935 states. [2022-12-14 10:36:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71935 to 71935. [2022-12-14 10:36:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71935 states, 69730 states have (on average 2.151412591424064) internal successors, (150018), 71934 states have internal predecessors, (150018), 0 states have call successors, (0), 0 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 10:36:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71935 states to 71935 states and 150018 transitions. [2022-12-14 10:36:03,902 INFO L78 Accepts]: Start accepts. Automaton has 71935 states and 150018 transitions. Word has length 15 [2022-12-14 10:36:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:36:03,903 INFO L495 AbstractCegarLoop]: Abstraction has 71935 states and 150018 transitions. [2022-12-14 10:36:03,903 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 10:36:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 71935 states and 150018 transitions. [2022-12-14 10:36:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 10:36:03,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:36:03,904 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:36:03,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 10:36:03,904 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:36:03,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:36:03,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2048047689, now seen corresponding path program 1 times [2022-12-14 10:36:03,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:36:03,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745320216] [2022-12-14 10:36:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:36:03,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:36:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:36:04,038 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 10:36:04,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:36:04,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745320216] [2022-12-14 10:36:04,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745320216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:36:04,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:36:04,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:36:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359253258] [2022-12-14 10:36:04,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:36:04,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:36:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:36:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:36:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:36:04,040 INFO L87 Difference]: Start difference. First operand 71935 states and 150018 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 10:36:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:36:05,679 INFO L93 Difference]: Finished difference Result 72181 states and 150521 transitions. [2022-12-14 10:36:05,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:36:05,679 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 10:36:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:36:05,850 INFO L225 Difference]: With dead ends: 72181 [2022-12-14 10:36:05,851 INFO L226 Difference]: Without dead ends: 72181 [2022-12-14 10:36:05,851 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 10:36:05,851 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 160 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:36:05,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 397 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 10:36:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72181 states. [2022-12-14 10:36:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72181 to 72181. [2022-12-14 10:36:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72181 states, 69977 states have (on average 2.151006759363791) internal successors, (150521), 72180 states have internal predecessors, (150521), 0 states have call successors, (0), 0 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 10:36:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72181 states to 72181 states and 150521 transitions. [2022-12-14 10:36:07,409 INFO L78 Accepts]: Start accepts. Automaton has 72181 states and 150521 transitions. Word has length 16 [2022-12-14 10:36:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:36:07,410 INFO L495 AbstractCegarLoop]: Abstraction has 72181 states and 150521 transitions. [2022-12-14 10:36:07,410 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 10:36:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 72181 states and 150521 transitions. [2022-12-14 10:36:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:36:07,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:36:07,411 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 10:36:07,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 10:36:07,411 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:36:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:36:07,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1233502370, now seen corresponding path program 1 times [2022-12-14 10:36:07,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:36:07,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847953957] [2022-12-14 10:36:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:36:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:36:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:36:07,786 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 10:36:07,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:36:07,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847953957] [2022-12-14 10:36:07,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847953957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:36:07,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442747772] [2022-12-14 10:36:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:36:07,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:36:07,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:36:07,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:36:07,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 10:36:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:36:07,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-14 10:36:07,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:36:07,993 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-14 10:36:07,993 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 4 case distinctions, treesize of input 20 treesize of output 30 [2022-12-14 10:36:08,067 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 10:36:08,113 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 10:36:08,113 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 16 treesize of output 18 [2022-12-14 10:36:08,130 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:36:08,130 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-14 10:36:08,148 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 10:36:08,189 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 21 treesize of output 23 [2022-12-14 10:36:08,322 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 20 treesize of output 12 [2022-12-14 10:36:08,458 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 10:36:08,506 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-14 10:36:08,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-12-14 10:36:08,531 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 10:36:08,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:36:08,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:36:08,807 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 32 treesize of output 33 [2022-12-14 10:36:08,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:36:08,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 84 [2022-12-14 10:36:08,824 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 70 treesize of output 62 [2022-12-14 10:36:08,830 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 10:36:09,062 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 10:36:09,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442747772] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:36:09,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1583008918] [2022-12-14 10:36:09,065 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 10:36:09,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:36:09,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 27 [2022-12-14 10:36:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333457905] [2022-12-14 10:36:09,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:36:09,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 10:36:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:36:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 10:36:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2022-12-14 10:36:09,067 INFO L87 Difference]: Start difference. First operand 72181 states and 150521 transitions. Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 10:36:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:36:23,354 INFO L93 Difference]: Finished difference Result 72685 states and 151053 transitions. [2022-12-14 10:36:23,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:36:23,354 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 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 10:36:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:36:23,495 INFO L225 Difference]: With dead ends: 72685 [2022-12-14 10:36:23,495 INFO L226 Difference]: Without dead ends: 72685 [2022-12-14 10:36:23,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 10:36:23,497 INFO L413 NwaCegarLoop]: 492 mSDtfsCounter, 7714 mSDsluCounter, 5410 mSDsCounter, 0 mSdLazyCounter, 9529 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7714 SdHoareTripleChecker+Valid, 5902 SdHoareTripleChecker+Invalid, 9563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 9529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:36:23,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7714 Valid, 5902 Invalid, 9563 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 9529 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2022-12-14 10:36:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72685 states. [2022-12-14 10:36:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72685 to 72165. [2022-12-14 10:36:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72165 states, 69962 states have (on average 2.1510105485835167) internal successors, (150489), 72164 states have internal predecessors, (150489), 0 states have call successors, (0), 0 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 10:36:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72165 states to 72165 states and 150489 transitions. [2022-12-14 10:36:24,615 INFO L78 Accepts]: Start accepts. Automaton has 72165 states and 150489 transitions. Word has length 18 [2022-12-14 10:36:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:36:24,615 INFO L495 AbstractCegarLoop]: Abstraction has 72165 states and 150489 transitions. [2022-12-14 10:36:24,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 10:36:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 72165 states and 150489 transitions. [2022-12-14 10:36:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:36:24,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:36:24,616 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 10:36:24,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 10:36:24,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:36:24,817 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:36:24,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:36:24,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1493688405, now seen corresponding path program 1 times [2022-12-14 10:36:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:36:24,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303940977] [2022-12-14 10:36:24,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:36:24,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:36:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:36:25,120 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 10:36:25,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:36:25,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303940977] [2022-12-14 10:36:25,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303940977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:36:25,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:36:25,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:36:25,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152622166] [2022-12-14 10:36:25,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:36:25,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:36:25,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:36:25,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:36:25,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:36:25,122 INFO L87 Difference]: Start difference. First operand 72165 states and 150489 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 10:36:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:36:27,510 INFO L93 Difference]: Finished difference Result 72171 states and 150501 transitions. [2022-12-14 10:36:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:36:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 10:36:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:36:27,648 INFO L225 Difference]: With dead ends: 72171 [2022-12-14 10:36:27,648 INFO L226 Difference]: Without dead ends: 72171 [2022-12-14 10:36:27,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:36:27,649 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 2258 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2258 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:36:27,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2258 Valid, 870 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 10:36:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72171 states. [2022-12-14 10:36:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72171 to 72149. [2022-12-14 10:36:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72149 states, 69947 states have (on average 2.1510143394284245) internal successors, (150457), 72148 states have internal predecessors, (150457), 0 states have call successors, (0), 0 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 10:36:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72149 states to 72149 states and 150457 transitions. [2022-12-14 10:36:28,755 INFO L78 Accepts]: Start accepts. Automaton has 72149 states and 150457 transitions. Word has length 18 [2022-12-14 10:36:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:36:28,755 INFO L495 AbstractCegarLoop]: Abstraction has 72149 states and 150457 transitions. [2022-12-14 10:36:28,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 10:36:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 72149 states and 150457 transitions. [2022-12-14 10:36:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:36:28,756 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:36:28,756 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 10:36:28,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 10:36:28,756 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting worker_fnErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:36:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:36:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash 228085684, now seen corresponding path program 1 times [2022-12-14 10:36:28,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:36:28,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538996519] [2022-12-14 10:36:28,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:36:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:36:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:36:28,831 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 10:36:28,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:36:28,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538996519] [2022-12-14 10:36:28,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538996519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:36:28,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:36:28,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:36:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977046772] [2022-12-14 10:36:28,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:36:28,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:36:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:36:28,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:36:28,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:36:28,833 INFO L87 Difference]: Start difference. First operand 72149 states and 150457 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 10:36:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:36:30,361 INFO L93 Difference]: Finished difference Result 73439 states and 153097 transitions. [2022-12-14 10:36:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:36:30,361 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 10:36:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:36:30,535 INFO L225 Difference]: With dead ends: 73439 [2022-12-14 10:36:30,535 INFO L226 Difference]: Without dead ends: 73439 [2022-12-14 10:36:30,535 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 10:36:30,536 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 174 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:36:30,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 392 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 10:36:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73439 states. [2022-12-14 10:36:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73439 to 72393. [2022-12-14 10:36:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72393 states, 70193 states have (on average 2.1505990625845883) internal successors, (150957), 72392 states have internal predecessors, (150957), 0 states have call successors, (0), 0 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 10:36:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72393 states to 72393 states and 150957 transitions. [2022-12-14 10:36:31,661 INFO L78 Accepts]: Start accepts. Automaton has 72393 states and 150957 transitions. Word has length 18 [2022-12-14 10:36:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:36:31,661 INFO L495 AbstractCegarLoop]: Abstraction has 72393 states and 150957 transitions. [2022-12-14 10:36:31,661 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 10:36:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 72393 states and 150957 transitions. [2022-12-14 10:36:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 10:36:31,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:36:31,662 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 10:36:31,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 10:36:31,662 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:36:31,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:36:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash -860205869, now seen corresponding path program 1 times [2022-12-14 10:36:31,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:36:31,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413757817] [2022-12-14 10:36:31,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:36:31,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:36:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:36:31,731 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 10:36:31,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:36:31,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413757817] [2022-12-14 10:36:31,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413757817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:36:31,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:36:31,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:36:31,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487250732] [2022-12-14 10:36:31,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:36:31,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:36:31,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:36:31,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:36:31,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:36:31,732 INFO L87 Difference]: Start difference. First operand 72393 states and 150957 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 10:36:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:36:33,352 INFO L93 Difference]: Finished difference Result 73602 states and 153430 transitions. [2022-12-14 10:36:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:36:33,352 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 10:36:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:36:33,489 INFO L225 Difference]: With dead ends: 73602 [2022-12-14 10:36:33,489 INFO L226 Difference]: Without dead ends: 73602 [2022-12-14 10:36:33,489 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 10:36:33,489 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 163 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:36:33,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 392 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 10:36:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73602 states. [2022-12-14 10:36:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73602 to 72620. [2022-12-14 10:36:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72620 states, 70423 states have (on average 2.1501782088238217) internal successors, (151422), 72619 states have internal predecessors, (151422), 0 states have call successors, (0), 0 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 10:36:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72620 states to 72620 states and 151422 transitions. [2022-12-14 10:36:34,693 INFO L78 Accepts]: Start accepts. Automaton has 72620 states and 151422 transitions. Word has length 19 [2022-12-14 10:36:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:36:34,693 INFO L495 AbstractCegarLoop]: Abstraction has 72620 states and 151422 transitions. [2022-12-14 10:36:34,693 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 10:36:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 72620 states and 151422 transitions. [2022-12-14 10:36:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:36:34,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:36:34,695 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 10:36:34,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 10:36:34,695 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:36:34,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:36:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash 562583121, now seen corresponding path program 1 times [2022-12-14 10:36:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:36:34,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507840531] [2022-12-14 10:36:34,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:36:34,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:36:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:36:35,275 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 10:36:35,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:36:35,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507840531] [2022-12-14 10:36:35,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507840531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:36:35,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369988398] [2022-12-14 10:36:35,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:36:35,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:36:35,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:36:35,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:36:35,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 10:36:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:36:35,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 10:36:35,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:36:35,515 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 10:36:35,515 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 10:36:35,588 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 10:36:35,612 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 10:36:35,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:36:35,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 34 [2022-12-14 10:36:35,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:36:35,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-12-14 10:36:35,730 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 43 treesize of output 39 [2022-12-14 10:36:35,762 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 10:36:35,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:36:35,785 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-12-14 10:36:35,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-12-14 10:36:35,828 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-12-14 10:36:35,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_1904) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3) 0))))) is different from false [2022-12-14 10:36:35,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:36:35,867 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 37 treesize of output 53 [2022-12-14 10:36:35,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:36:35,872 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 66 treesize of output 36 [2022-12-14 10:36:35,880 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-12-14 10:36:35,880 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-12-14 10:36:35,885 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-12-14 10:36:35,886 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-12-14 10:36:35,891 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-12-14 10:36:35,891 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-12-14 10:36:35,910 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 10:36:35,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369988398] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:36:35,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [919096632] [2022-12-14 10:36:35,911 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 10:36:35,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:36:35,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-12-14 10:36:35,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059248770] [2022-12-14 10:36:35,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:36:35,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 10:36:35,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:36:35,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 10:36:35,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=268, Unknown=4, NotChecked=148, Total=506 [2022-12-14 10:36:35,913 INFO L87 Difference]: Start difference. First operand 72620 states and 151422 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 10:36:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:36:59,417 INFO L93 Difference]: Finished difference Result 83217 states and 173507 transitions. [2022-12-14 10:36:59,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 10:36:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 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 10:36:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:36:59,587 INFO L225 Difference]: With dead ends: 83217 [2022-12-14 10:36:59,587 INFO L226 Difference]: Without dead ends: 83217 [2022-12-14 10:36:59,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=443, Invalid=964, Unknown=15, NotChecked=300, Total=1722 [2022-12-14 10:36:59,588 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 5802 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 7565 mSolverCounterSat, 601 mSolverCounterUnsat, 3337 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5802 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 23494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 7565 IncrementalHoareTripleChecker+Invalid, 3337 IncrementalHoareTripleChecker+Unknown, 11991 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:36:59,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5802 Valid, 1422 Invalid, 23494 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [601 Valid, 7565 Invalid, 3337 Unknown, 11991 Unchecked, 22.1s Time] [2022-12-14 10:36:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83217 states. [2022-12-14 10:37:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83217 to 72657. [2022-12-14 10:37:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72657 states, 70460 states have (on average 2.1500993471473175) internal successors, (151496), 72656 states have internal predecessors, (151496), 0 states have call successors, (0), 0 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 10:37:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72657 states to 72657 states and 151496 transitions. [2022-12-14 10:37:00,793 INFO L78 Accepts]: Start accepts. Automaton has 72657 states and 151496 transitions. Word has length 21 [2022-12-14 10:37:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:00,793 INFO L495 AbstractCegarLoop]: Abstraction has 72657 states and 151496 transitions. [2022-12-14 10:37:00,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 10:37:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 72657 states and 151496 transitions. [2022-12-14 10:37:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:37:00,794 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:00,794 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 10:37:00,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 10:37:00,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 10:37:00,996 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:37:00,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:00,997 INFO L85 PathProgramCache]: Analyzing trace with hash 563105781, now seen corresponding path program 2 times [2022-12-14 10:37:00,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:00,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313841950] [2022-12-14 10:37:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:00,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:01,451 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 10:37:01,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:01,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313841950] [2022-12-14 10:37:01,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313841950] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:37:01,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394463707] [2022-12-14 10:37:01,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:37:01,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:37:01,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:37:01,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:37:01,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 10:37:02,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:37:02,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:37:02,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 10:37:02,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:37:02,559 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 10:37:02,559 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 10:37:02,702 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 10:37:02,726 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 23 treesize of output 22 [2022-12-14 10:37:02,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 10:37:02,793 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 10:37:02,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 10:37:02,862 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 10:37:02,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:37:02,884 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2169) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2169) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2169) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-12-14 10:37:02,899 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2169) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2169) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2169) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-12-14 10:37:02,913 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2169) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2169) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_2169) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2) 0))))) is different from false [2022-12-14 10:37:02,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:37:02,925 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 3 case distinctions, treesize of input 32 treesize of output 43 [2022-12-14 10:37:02,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:37:02,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 32 [2022-12-14 10:37:02,931 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 10:37:02,937 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-14 10:37:02,937 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 1 [2022-12-14 10:37:02,941 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-14 10:37:02,941 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 1 [2022-12-14 10:37:02,960 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 10:37:02,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394463707] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:37:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1176808315] [2022-12-14 10:37:02,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 10:37:02,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:37:02,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2022-12-14 10:37:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101205940] [2022-12-14 10:37:02,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:37:02,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 10:37:02,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 10:37:02,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=346, Unknown=3, NotChecked=120, Total=552 [2022-12-14 10:37:02,963 INFO L87 Difference]: Start difference. First operand 72657 states and 151496 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 10:37:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:16,967 INFO L93 Difference]: Finished difference Result 159082 states and 331757 transitions. [2022-12-14 10:37:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 10:37:16,967 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 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 10:37:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:17,297 INFO L225 Difference]: With dead ends: 159082 [2022-12-14 10:37:17,297 INFO L226 Difference]: Without dead ends: 159082 [2022-12-14 10:37:17,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=503, Invalid=1576, Unknown=3, NotChecked=270, Total=2352 [2022-12-14 10:37:17,299 INFO L413 NwaCegarLoop]: 706 mSDtfsCounter, 7226 mSDsluCounter, 2737 mSDsCounter, 0 mSdLazyCounter, 16084 mSolverCounterSat, 748 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7226 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 27573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 16084 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 10726 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:17,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7226 Valid, 3443 Invalid, 27573 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [748 Valid, 16084 Invalid, 15 Unknown, 10726 Unchecked, 12.1s Time] [2022-12-14 10:37:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159082 states. [2022-12-14 10:37:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159082 to 72470. [2022-12-14 10:37:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72470 states, 70277 states have (on average 2.1502340737367844) internal successors, (151112), 72469 states have internal predecessors, (151112), 0 states have call successors, (0), 0 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 10:37:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72470 states to 72470 states and 151112 transitions. [2022-12-14 10:37:18,890 INFO L78 Accepts]: Start accepts. Automaton has 72470 states and 151112 transitions. Word has length 21 [2022-12-14 10:37:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:18,890 INFO L495 AbstractCegarLoop]: Abstraction has 72470 states and 151112 transitions. [2022-12-14 10:37:18,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 10:37:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 72470 states and 151112 transitions. [2022-12-14 10:37:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:37:18,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:18,891 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 10:37:18,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 10:37:19,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 10:37:19,093 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:37:19,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1779389725, now seen corresponding path program 1 times [2022-12-14 10:37:19,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:19,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875373703] [2022-12-14 10:37:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:20,208 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 10:37:20,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:20,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875373703] [2022-12-14 10:37:20,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875373703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:37:20,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291689331] [2022-12-14 10:37:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:20,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:37:20,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:37:20,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:37:20,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 10:37:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:20,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 10:37:20,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:37:20,408 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 10:37:20,408 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 10:37:20,553 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 10:37:20,586 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 10:37:20,634 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 10:37:20,686 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 10:37:20,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,749 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 10:37:20,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,782 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 10:37:20,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,808 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 10:37:20,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:37:20,839 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 10:37:20,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 43 treesize of output 39 [2022-12-14 10:37:20,936 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 10:37:20,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:37:20,952 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2446) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2446) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2446) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2446) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0))) is different from false [2022-12-14 10:37:30,166 INFO L321 Elim1Store]: treesize reduction 548, result has 31.6 percent of original size [2022-12-14 10:37:30,167 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 8 case distinctions, treesize of input 87 treesize of output 265 [2022-12-14 10:37:30,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:37:30,175 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 238 treesize of output 208 [2022-12-14 10:37:30,220 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 10:37:30,358 INFO L321 Elim1Store]: treesize reduction 683, result has 14.7 percent of original size [2022-12-14 10:37:30,358 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 130 [2022-12-14 10:37:30,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:37:30,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 44 [2022-12-14 10:37:30,480 INFO L321 Elim1Store]: treesize reduction 720, result has 10.1 percent of original size [2022-12-14 10:37:30,481 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 93 [2022-12-14 10:37:30,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:37:30,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-12-14 10:37:30,689 INFO L217 Elim1Store]: Index analysis took 195 ms [2022-12-14 10:37:30,719 INFO L321 Elim1Store]: treesize reduction 800, result has 0.1 percent of original size [2022-12-14 10:37:30,720 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 10:37:31,322 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 10:37:31,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291689331] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:37:31,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [572773604] [2022-12-14 10:37:31,323 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 10:37:31,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:37:31,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 36 [2022-12-14 10:37:31,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669190415] [2022-12-14 10:37:31,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:37:31,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 10:37:31,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 10:37:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1046, Unknown=96, NotChecked=70, Total=1406 [2022-12-14 10:37:31,325 INFO L87 Difference]: Start difference. First operand 72470 states and 151112 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 0 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 10:39:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:17,170 INFO L93 Difference]: Finished difference Result 151743 states and 316553 transitions. [2022-12-14 10:39:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 10:39:17,170 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 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 10:39:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:17,525 INFO L225 Difference]: With dead ends: 151743 [2022-12-14 10:39:17,525 INFO L226 Difference]: Without dead ends: 151743 [2022-12-14 10:39:17,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=399, Invalid=1861, Unknown=96, NotChecked=94, Total=2450 [2022-12-14 10:39:17,528 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 6629 mSDsluCounter, 6254 mSDsCounter, 0 mSdLazyCounter, 29938 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6629 SdHoareTripleChecker+Valid, 6928 SdHoareTripleChecker+Invalid, 32482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 29938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1922 IncrementalHoareTripleChecker+Unchecked, 103.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:17,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6629 Valid, 6928 Invalid, 32482 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [622 Valid, 29938 Invalid, 0 Unknown, 1922 Unchecked, 103.6s Time] [2022-12-14 10:39:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151743 states. [2022-12-14 10:39:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151743 to 72505. [2022-12-14 10:39:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72505 states, 70312 states have (on average 2.1501592900216178) internal successors, (151182), 72504 states have internal predecessors, (151182), 0 states have call successors, (0), 0 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 10:39:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72505 states to 72505 states and 151182 transitions. [2022-12-14 10:39:19,222 INFO L78 Accepts]: Start accepts. Automaton has 72505 states and 151182 transitions. Word has length 21 [2022-12-14 10:39:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:19,223 INFO L495 AbstractCegarLoop]: Abstraction has 72505 states and 151182 transitions. [2022-12-14 10:39:19,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 0 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 10:39:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 72505 states and 151182 transitions. [2022-12-14 10:39:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:39:19,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:19,224 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 10:39:19,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 10:39:19,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 10:39:19,425 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting worker_fnErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:39:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash 265674526, now seen corresponding path program 1 times [2022-12-14 10:39:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:19,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926092297] [2022-12-14 10:39:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:19,498 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 10:39:19,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:19,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926092297] [2022-12-14 10:39:19,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926092297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:19,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:19,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924056103] [2022-12-14 10:39:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:19,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:19,499 INFO L87 Difference]: Start difference. First operand 72505 states and 151182 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 10:39:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:21,032 INFO L93 Difference]: Finished difference Result 72746 states and 151676 transitions. [2022-12-14 10:39:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:21,032 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 10:39:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:21,175 INFO L225 Difference]: With dead ends: 72746 [2022-12-14 10:39:21,175 INFO L226 Difference]: Without dead ends: 72746 [2022-12-14 10:39:21,175 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 10:39:21,176 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 171 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:21,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 394 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 10:39:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72746 states. [2022-12-14 10:39:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72746 to 72746. [2022-12-14 10:39:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72746 states, 70556 states have (on average 2.149725041102103) internal successors, (151676), 72745 states have internal predecessors, (151676), 0 states have call successors, (0), 0 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 10:39:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72746 states to 72746 states and 151676 transitions. [2022-12-14 10:39:22,288 INFO L78 Accepts]: Start accepts. Automaton has 72746 states and 151676 transitions. Word has length 21 [2022-12-14 10:39:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:22,288 INFO L495 AbstractCegarLoop]: Abstraction has 72746 states and 151676 transitions. [2022-12-14 10:39:22,288 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 10:39:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 72746 states and 151676 transitions. [2022-12-14 10:39:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:39:22,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:22,289 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 10:39:22,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 10:39:22,289 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting worker_fnErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:39:22,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1108972463, now seen corresponding path program 1 times [2022-12-14 10:39:22,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:22,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483554991] [2022-12-14 10:39:22,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:22,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:22,336 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 10:39:22,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:22,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483554991] [2022-12-14 10:39:22,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483554991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:22,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:22,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:39:22,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548493991] [2022-12-14 10:39:22,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:22,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:22,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:22,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:22,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:22,338 INFO L87 Difference]: Start difference. First operand 72746 states and 151676 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 10:39:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:23,547 INFO L93 Difference]: Finished difference Result 75452 states and 157208 transitions. [2022-12-14 10:39:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:23,547 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 10:39:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:23,690 INFO L225 Difference]: With dead ends: 75452 [2022-12-14 10:39:23,690 INFO L226 Difference]: Without dead ends: 75452 [2022-12-14 10:39:23,690 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 10:39:23,691 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 291 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:23,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 853 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 10:39:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75452 states. [2022-12-14 10:39:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75452 to 73024. [2022-12-14 10:39:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73024 states, 70834 states have (on average 2.1493068300533644) internal successors, (152244), 73023 states have internal predecessors, (152244), 0 states have call successors, (0), 0 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 10:39:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73024 states to 73024 states and 152244 transitions. [2022-12-14 10:39:25,181 INFO L78 Accepts]: Start accepts. Automaton has 73024 states and 152244 transitions. Word has length 21 [2022-12-14 10:39:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:25,181 INFO L495 AbstractCegarLoop]: Abstraction has 73024 states and 152244 transitions. [2022-12-14 10:39:25,181 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 10:39:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 73024 states and 152244 transitions. [2022-12-14 10:39:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:39:25,182 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:25,182 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 10:39:25,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 10:39:25,182 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:39:25,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1744800539, now seen corresponding path program 2 times [2022-12-14 10:39:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:25,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737466530] [2022-12-14 10:39:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:26,425 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 10:39:26,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737466530] [2022-12-14 10:39:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737466530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:39:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895361200] [2022-12-14 10:39:26,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:39:26,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:39:26,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:39:26,426 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:39:26,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 10:39:26,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 10:39:26,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:39:26,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 10:39:26,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:26,646 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:39:26,646 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 10:39:26,690 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 10:39:26,715 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 10:39:26,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:26,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 34 [2022-12-14 10:39:26,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:26,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-12-14 10:39:26,893 INFO L321 Elim1Store]: treesize reduction 78, result has 49.0 percent of original size [2022-12-14 10:39:26,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 96 [2022-12-14 10:39:27,063 INFO L321 Elim1Store]: treesize reduction 78, result has 49.0 percent of original size [2022-12-14 10:39:27,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 134 [2022-12-14 10:39:27,275 INFO L321 Elim1Store]: treesize reduction 78, result has 49.0 percent of original size [2022-12-14 10:39:27,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 168 [2022-12-14 10:39:27,516 INFO L321 Elim1Store]: treesize reduction 116, result has 24.2 percent of original size [2022-12-14 10:39:27,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 156 treesize of output 164 [2022-12-14 10:39:27,884 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 43 treesize of output 39 [2022-12-14 10:39:27,922 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 10:39:27,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:39:27,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895361200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:27,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:39:27,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2022-12-14 10:39:27,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533652929] [2022-12-14 10:39:27,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:27,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 10:39:27,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:27,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 10:39:27,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-12-14 10:39:27,924 INFO L87 Difference]: Start difference. First operand 73024 states and 152244 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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 10:39:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:38,654 INFO L93 Difference]: Finished difference Result 80218 states and 167368 transitions. [2022-12-14 10:39:38,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:39:38,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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 10:39:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:38,806 INFO L225 Difference]: With dead ends: 80218 [2022-12-14 10:39:38,806 INFO L226 Difference]: Without dead ends: 80218 [2022-12-14 10:39:38,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2022-12-14 10:39:38,807 INFO L413 NwaCegarLoop]: 541 mSDtfsCounter, 2695 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 9216 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2695 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 9761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 9216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:38,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2695 Valid, 1383 Invalid, 9761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 9216 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-12-14 10:39:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80218 states. [2022-12-14 10:39:39,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80218 to 72839. [2022-12-14 10:39:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72839 states, 70652 states have (on average 2.1494649832984205) internal successors, (151864), 72838 states have internal predecessors, (151864), 0 states have call successors, (0), 0 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 10:39:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72839 states to 72839 states and 151864 transitions. [2022-12-14 10:39:40,038 INFO L78 Accepts]: Start accepts. Automaton has 72839 states and 151864 transitions. Word has length 21 [2022-12-14 10:39:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:40,039 INFO L495 AbstractCegarLoop]: Abstraction has 72839 states and 151864 transitions. [2022-12-14 10:39:40,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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 10:39:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 72839 states and 151864 transitions. [2022-12-14 10:39:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 10:39:40,039 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:40,040 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 10:39:40,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 10:39:40,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:39:40,241 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:39:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1680057024, now seen corresponding path program 1 times [2022-12-14 10:39:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:40,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117705847] [2022-12-14 10:39:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:40,375 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 10:39:40,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:40,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117705847] [2022-12-14 10:39:40,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117705847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:40,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:40,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:40,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093658974] [2022-12-14 10:39:40,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:40,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:40,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:40,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:40,377 INFO L87 Difference]: Start difference. First operand 72839 states and 151864 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 10:39:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:42,117 INFO L93 Difference]: Finished difference Result 73069 states and 152335 transitions. [2022-12-14 10:39:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:42,117 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 10:39:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:42,356 INFO L225 Difference]: With dead ends: 73069 [2022-12-14 10:39:42,356 INFO L226 Difference]: Without dead ends: 73069 [2022-12-14 10:39:42,356 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 10:39:42,356 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 159 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:42,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 396 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 10:39:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73069 states. [2022-12-14 10:39:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73069 to 73069. [2022-12-14 10:39:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73069 states, 70885 states have (on average 2.149044226564153) internal successors, (152335), 73068 states have internal predecessors, (152335), 0 states have call successors, (0), 0 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 10:39:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73069 states to 73069 states and 152335 transitions. [2022-12-14 10:39:43,465 INFO L78 Accepts]: Start accepts. Automaton has 73069 states and 152335 transitions. Word has length 22 [2022-12-14 10:39:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:43,465 INFO L495 AbstractCegarLoop]: Abstraction has 73069 states and 152335 transitions. [2022-12-14 10:39:43,465 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 10:39:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 73069 states and 152335 transitions. [2022-12-14 10:39:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 10:39:43,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:43,466 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 10:39:43,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 10:39:43,466 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:39:43,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1590411836, now seen corresponding path program 1 times [2022-12-14 10:39:43,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:43,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450106368] [2022-12-14 10:39:43,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:43,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:43,515 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 10:39:43,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:43,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450106368] [2022-12-14 10:39:43,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450106368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:43,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:43,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:39:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520083089] [2022-12-14 10:39:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:43,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:43,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:43,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:43,516 INFO L87 Difference]: Start difference. First operand 73069 states and 152335 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 10:39:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:44,699 INFO L93 Difference]: Finished difference Result 75601 states and 157509 transitions. [2022-12-14 10:39:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:44,700 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 10:39:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:44,837 INFO L225 Difference]: With dead ends: 75601 [2022-12-14 10:39:44,837 INFO L226 Difference]: Without dead ends: 75601 [2022-12-14 10:39:44,837 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 10:39:44,838 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 273 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:44,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 846 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 10:39:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75601 states. [2022-12-14 10:39:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75601 to 73328. [2022-12-14 10:39:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73328 states, 71144 states have (on average 2.1486562464860004) internal successors, (152864), 73327 states have internal predecessors, (152864), 0 states have call successors, (0), 0 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 10:39:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73328 states to 73328 states and 152864 transitions. [2022-12-14 10:39:46,086 INFO L78 Accepts]: Start accepts. Automaton has 73328 states and 152864 transitions. Word has length 22 [2022-12-14 10:39:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:46,086 INFO L495 AbstractCegarLoop]: Abstraction has 73328 states and 152864 transitions. [2022-12-14 10:39:46,086 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 10:39:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 73328 states and 152864 transitions. [2022-12-14 10:39:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:39:46,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:46,087 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 10:39:46,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 10:39:46,087 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:39:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1211842815, now seen corresponding path program 1 times [2022-12-14 10:39:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:46,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799911613] [2022-12-14 10:39:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:47,230 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 10:39:47,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:47,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799911613] [2022-12-14 10:39:47,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799911613] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:39:47,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850284785] [2022-12-14 10:39:47,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:47,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:39:47,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:39:47,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:39:47,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 10:39:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:47,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-14 10:39:47,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:39:47,478 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-14 10:39:47,479 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 10:39:47,527 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 10:39:47,593 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 10:39:47,663 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 10:39:47,686 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 10:39:47,686 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 10:39:47,729 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 10:39:47,895 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 10:39:48,014 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 10:39:48,064 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 10:39:48,079 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 10:39:48,087 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 10:39:48,101 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 10:39:48,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:39:48,189 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 10:39:48,227 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 10:39:48,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:39:48,297 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_worker_fnThread1of1ForFork0_#t~mem26#1| |c_ULTIMATE.start_worker_fn_~tid~0#1|)) (forall ((v_ArrVal_3515 (Array Int Int))) (= |c_ULTIMATE.start_worker_fn_#t~nondet27#1| (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| v_ArrVal_3515) |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |c_ULTIMATE.start_worker_fn_~tid~0#1|))))) is different from false [2022-12-14 10:39:48,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:48,318 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 10:39:48,321 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 10:39:48,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:48,747 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 10:39:48,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:48,768 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 10:39:48,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:48,778 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 10:39:48,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:39:48,786 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 10:39:48,897 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 10:39:48,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850284785] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:39:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1755500939] [2022-12-14 10:39:48,898 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 10:39:48,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:39:48,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2022-12-14 10:39:48,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414343423] [2022-12-14 10:39:48,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:39:48,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 10:39:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 10:39:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1347, Unknown=2, NotChecked=74, Total=1560 [2022-12-14 10:39:48,900 INFO L87 Difference]: Start difference. First operand 73328 states and 152864 transitions. Second operand has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 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 10:40:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:40:08,742 INFO L93 Difference]: Finished difference Result 76103 states and 158536 transitions. [2022-12-14 10:40:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 10:40:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 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 10:40:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:40:08,883 INFO L225 Difference]: With dead ends: 76103 [2022-12-14 10:40:08,883 INFO L226 Difference]: Without dead ends: 76103 [2022-12-14 10:40:08,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=439, Invalid=2533, Unknown=2, NotChecked=106, Total=3080 [2022-12-14 10:40:08,884 INFO L413 NwaCegarLoop]: 498 mSDtfsCounter, 1470 mSDsluCounter, 8049 mSDsCounter, 0 mSdLazyCounter, 15252 mSolverCounterSat, 38 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 8547 SdHoareTripleChecker+Invalid, 16457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 15252 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 1155 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:40:08,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 8547 Invalid, 16457 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 15252 Invalid, 12 Unknown, 1155 Unchecked, 18.2s Time] [2022-12-14 10:40:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76103 states. [2022-12-14 10:40:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76103 to 73371. [2022-12-14 10:40:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73371 states, 71187 states have (on average 2.148566451739784) internal successors, (152950), 73370 states have internal predecessors, (152950), 0 states have call successors, (0), 0 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 10:40:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73371 states to 73371 states and 152950 transitions. [2022-12-14 10:40:10,022 INFO L78 Accepts]: Start accepts. Automaton has 73371 states and 152950 transitions. Word has length 24 [2022-12-14 10:40:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:40:10,022 INFO L495 AbstractCegarLoop]: Abstraction has 73371 states and 152950 transitions. [2022-12-14 10:40:10,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 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 10:40:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 73371 states and 152950 transitions. [2022-12-14 10:40:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:40:10,023 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:40:10,023 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 10:40:10,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 10:40:10,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 10:40:10,224 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:40:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:40:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1103477691, now seen corresponding path program 2 times [2022-12-14 10:40:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:40:10,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606524831] [2022-12-14 10:40:10,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:40:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:40:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:40:11,045 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 10:40:11,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:40:11,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606524831] [2022-12-14 10:40:11,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606524831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:40:11,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253350082] [2022-12-14 10:40:11,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:40:11,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:40:11,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:40:11,047 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:40:11,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 10:40:12,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:40:12,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:40:12,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-14 10:40:12,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:40:12,486 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:40:12,486 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 10:40:12,524 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 10:40:12,570 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 10:40:12,622 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 10:40:12,634 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 10:40:12,634 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 10:40:12,674 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 10:40:12,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:12,799 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 10:40:12,893 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 10:40:12,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:40:12,930 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 10:40:12,960 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 10:40:12,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:40:13,130 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3803 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_3803) |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 10:40:13,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:13,270 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 10:40:13,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:13,291 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 10:40:13,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:13,301 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 10:40:13,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:13,310 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 10:40:13,424 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 10:40:13,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253350082] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:40:13,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1804863156] [2022-12-14 10:40:13,425 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 10:40:13,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:40:13,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-12-14 10:40:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013391614] [2022-12-14 10:40:13,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:40:13,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 10:40:13,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:40:13,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 10:40:13,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1020, Unknown=2, NotChecked=64, Total=1190 [2022-12-14 10:40:13,427 INFO L87 Difference]: Start difference. First operand 73371 states and 152950 transitions. Second operand has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 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 10:40:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:40:33,197 INFO L93 Difference]: Finished difference Result 144069 states and 300449 transitions. [2022-12-14 10:40:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 10:40:33,197 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 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 10:40:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:40:33,511 INFO L225 Difference]: With dead ends: 144069 [2022-12-14 10:40:33,511 INFO L226 Difference]: Without dead ends: 144069 [2022-12-14 10:40:33,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=396, Invalid=2156, Unknown=2, NotChecked=98, Total=2652 [2022-12-14 10:40:33,512 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 3286 mSDsluCounter, 13431 mSDsCounter, 0 mSdLazyCounter, 18233 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3286 SdHoareTripleChecker+Valid, 14228 SdHoareTripleChecker+Invalid, 20209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 18233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1946 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:40:33,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3286 Valid, 14228 Invalid, 20209 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 18233 Invalid, 0 Unknown, 1946 Unchecked, 18.0s Time] [2022-12-14 10:40:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144069 states. [2022-12-14 10:40:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144069 to 73375. [2022-12-14 10:40:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73375 states, 71191 states have (on average 2.1485581042547515) internal successors, (152958), 73374 states have internal predecessors, (152958), 0 states have call successors, (0), 0 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 10:40:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73375 states to 73375 states and 152958 transitions. [2022-12-14 10:40:35,084 INFO L78 Accepts]: Start accepts. Automaton has 73375 states and 152958 transitions. Word has length 24 [2022-12-14 10:40:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:40:35,085 INFO L495 AbstractCegarLoop]: Abstraction has 73375 states and 152958 transitions. [2022-12-14 10:40:35,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 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 10:40:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 73375 states and 152958 transitions. [2022-12-14 10:40:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:40:35,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:40:35,086 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 10:40:35,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 10:40:35,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 10:40:35,287 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:40:35,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:40:35,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1112822278, now seen corresponding path program 1 times [2022-12-14 10:40:35,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:40:35,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401624104] [2022-12-14 10:40:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:40:35,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:40:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:40:35,972 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 10:40:35,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:40:35,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401624104] [2022-12-14 10:40:35,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401624104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:40:35,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840934774] [2022-12-14 10:40:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:40:35,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:40:35,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:40:35,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:40:35,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 10:40:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:40:36,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-14 10:40:36,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:40:36,208 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:40:36,208 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 10:40:36,235 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 10:40:36,265 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 10:40:36,302 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 10:40:36,310 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 10:40:36,310 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 10:40:36,339 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 10:40:36,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:36,440 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 10:40:36,537 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 10:40:36,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:40:36,563 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 10:40:36,583 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 10:40:36,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:40:36,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4092 (Array Int Int))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_4092) |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 10:40:36,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:36,818 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 10:40:36,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:36,836 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 10:40:36,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:36,844 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 10:40:36,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:40:36,849 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 10:40:36,922 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 10:40:36,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840934774] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:40:36,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1266876387] [2022-12-14 10:40:36,923 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 10:40:36,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:40:36,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-12-14 10:40:36,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309022312] [2022-12-14 10:40:36,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:40:36,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 10:40:36,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:40:36,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 10:40:36,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1019, Unknown=3, NotChecked=64, Total=1190 [2022-12-14 10:40:36,924 INFO L87 Difference]: Start difference. First operand 73375 states and 152958 transitions. Second operand has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 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 10:40:56,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:40:56,306 INFO L93 Difference]: Finished difference Result 144048 states and 300407 transitions. [2022-12-14 10:40:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 10:40:56,306 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 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 10:40:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:40:56,610 INFO L225 Difference]: With dead ends: 144048 [2022-12-14 10:40:56,610 INFO L226 Difference]: Without dead ends: 144048 [2022-12-14 10:40:56,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=322, Invalid=2031, Unknown=3, NotChecked=94, Total=2450 [2022-12-14 10:40:56,611 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 3330 mSDsluCounter, 13945 mSDsCounter, 0 mSdLazyCounter, 19490 mSolverCounterSat, 24 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3330 SdHoareTripleChecker+Valid, 14741 SdHoareTripleChecker+Invalid, 20692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 19490 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 1163 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:40:56,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3330 Valid, 14741 Invalid, 20692 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 19490 Invalid, 15 Unknown, 1163 Unchecked, 18.0s Time] [2022-12-14 10:40:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144048 states. [2022-12-14 10:40:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144048 to 73377. [2022-12-14 10:40:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73377 states, 71193 states have (on average 2.1485539308639896) internal successors, (152962), 73376 states have internal predecessors, (152962), 0 states have call successors, (0), 0 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 10:40:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73377 states to 73377 states and 152962 transitions. [2022-12-14 10:40:58,134 INFO L78 Accepts]: Start accepts. Automaton has 73377 states and 152962 transitions. Word has length 24 [2022-12-14 10:40:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:40:58,135 INFO L495 AbstractCegarLoop]: Abstraction has 73377 states and 152962 transitions. [2022-12-14 10:40:58,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 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 10:40:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 73377 states and 152962 transitions. [2022-12-14 10:40:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:40:58,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:40:58,135 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 10:40:58,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 10:40:58,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:40:58,337 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:40:58,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:40:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash -58771038, now seen corresponding path program 2 times [2022-12-14 10:40:58,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:40:58,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688173846] [2022-12-14 10:40:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:40:58,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:40:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:40:58,987 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 10:40:58,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:40:58,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688173846] [2022-12-14 10:40:58,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688173846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:40:58,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756918374] [2022-12-14 10:40:58,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:40:58,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:40:58,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:40:58,988 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:40:58,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 10:41:00,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:41:00,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:41:00,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-14 10:41:00,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:41:00,412 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:41:00,413 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 10:41:00,445 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 10:41:00,482 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 10:41:00,519 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 10:41:00,529 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 10:41:00,529 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 10:41:00,565 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 10:41:00,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:00,652 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 10:41:00,736 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 10:41:00,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:00,768 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 10:41:00,789 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 10:41:00,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:41:01,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:01,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:01,097 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 80 [2022-12-14 10:41:01,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:01,115 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 106 treesize of output 118 [2022-12-14 10:41:01,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:01,125 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 66 treesize of output 50 [2022-12-14 10:41:01,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:01,134 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 28 treesize of output 20 [2022-12-14 10:41:01,270 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 10:41:01,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756918374] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:41:01,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [436299462] [2022-12-14 10:41:01,271 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 10:41:01,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:41:01,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-12-14 10:41:01,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755997477] [2022-12-14 10:41:01,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:41:01,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 10:41:01,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:41:01,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 10:41:01,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1079, Unknown=6, NotChecked=0, Total=1190 [2022-12-14 10:41:01,273 INFO L87 Difference]: Start difference. First operand 73377 states and 152962 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 10:41:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:41:27,778 INFO L93 Difference]: Finished difference Result 143922 states and 300144 transitions. [2022-12-14 10:41:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 10:41:27,778 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 10:41:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:41:28,079 INFO L225 Difference]: With dead ends: 143922 [2022-12-14 10:41:28,079 INFO L226 Difference]: Without dead ends: 143922 [2022-12-14 10:41:28,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=349, Invalid=2095, Unknown=6, NotChecked=0, Total=2450 [2022-12-14 10:41:28,080 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 2226 mSDsluCounter, 14665 mSDsCounter, 0 mSdLazyCounter, 28420 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 15490 SdHoareTripleChecker+Invalid, 28448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 28420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:41:28,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 15490 Invalid, 28448 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 28420 Invalid, 0 Unknown, 0 Unchecked, 24.6s Time] [2022-12-14 10:41:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143922 states. [2022-12-14 10:41:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143922 to 73392. [2022-12-14 10:41:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73392 states, 71208 states have (on average 2.1485226379058533) internal successors, (152992), 73391 states have internal predecessors, (152992), 0 states have call successors, (0), 0 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 10:41:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73392 states to 73392 states and 152992 transitions. [2022-12-14 10:41:29,632 INFO L78 Accepts]: Start accepts. Automaton has 73392 states and 152992 transitions. Word has length 24 [2022-12-14 10:41:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:41:29,632 INFO L495 AbstractCegarLoop]: Abstraction has 73392 states and 152992 transitions. [2022-12-14 10:41:29,632 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 10:41:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 73392 states and 152992 transitions. [2022-12-14 10:41:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:41:29,633 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:41:29,633 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 10:41:29,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 10:41:29,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 10:41:29,835 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:41:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:41:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash -36460285, now seen corresponding path program 3 times [2022-12-14 10:41:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:41:29,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284422852] [2022-12-14 10:41:29,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:41:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:41:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:41:30,507 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 10:41:30,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:41:30,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284422852] [2022-12-14 10:41:30,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284422852] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:41:30,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845435053] [2022-12-14 10:41:30,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:41:30,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:41:30,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:41:30,508 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:41:30,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 10:41:30,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:41:30,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:41:30,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 10:41:30,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:41:30,858 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:41:30,858 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 10:41:30,887 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 10:41:30,921 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 10:41:30,960 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:41:30,960 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 10:41:30,967 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 10:41:31,003 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 10:41:31,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:31,110 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 10:41:31,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 10:41:31,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:41:31,372 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 10:41:31,393 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 10:41:31,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:41:31,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:31,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 10:41:31,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:31,733 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 10:41:31,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:31,742 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 10:41:31,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:31,750 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 10:41:31,857 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 10:41:31,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845435053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:41:31,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1106654933] [2022-12-14 10:41:31,858 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 10:41:31,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:41:31,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-12-14 10:41:31,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342046950] [2022-12-14 10:41:31,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:41:31,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 10:41:31,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:41:31,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 10:41:31,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1143, Unknown=6, NotChecked=0, Total=1260 [2022-12-14 10:41:31,860 INFO L87 Difference]: Start difference. First operand 73392 states and 152992 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 10:41:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:41:52,650 INFO L93 Difference]: Finished difference Result 143926 states and 300152 transitions. [2022-12-14 10:41:52,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 10:41:52,651 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 10:41:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:41:52,963 INFO L225 Difference]: With dead ends: 143926 [2022-12-14 10:41:52,963 INFO L226 Difference]: Without dead ends: 143926 [2022-12-14 10:41:52,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=390, Invalid=2360, Unknown=6, NotChecked=0, Total=2756 [2022-12-14 10:41:52,964 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 2849 mSDsluCounter, 13126 mSDsCounter, 0 mSdLazyCounter, 24307 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2849 SdHoareTripleChecker+Valid, 13953 SdHoareTripleChecker+Invalid, 24342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 24307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:41:52,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2849 Valid, 13953 Invalid, 24342 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 24307 Invalid, 0 Unknown, 0 Unchecked, 19.4s Time] [2022-12-14 10:41:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143926 states. [2022-12-14 10:41:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143926 to 73388. [2022-12-14 10:41:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73388 states, 71204 states have (on average 2.148530981405539) internal successors, (152984), 73387 states have internal predecessors, (152984), 0 states have call successors, (0), 0 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 10:41:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73388 states to 73388 states and 152984 transitions. [2022-12-14 10:41:54,522 INFO L78 Accepts]: Start accepts. Automaton has 73388 states and 152984 transitions. Word has length 24 [2022-12-14 10:41:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:41:54,522 INFO L495 AbstractCegarLoop]: Abstraction has 73388 states and 152984 transitions. [2022-12-14 10:41:54,522 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 10:41:54,522 INFO L276 IsEmpty]: Start isEmpty. Operand 73388 states and 152984 transitions. [2022-12-14 10:41:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:41:54,523 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:41:54,523 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 10:41:54,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 10:41:54,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 10:41:54,725 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:41:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:41:54,727 INFO L85 PathProgramCache]: Analyzing trace with hash 895105140, now seen corresponding path program 3 times [2022-12-14 10:41:54,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:41:54,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103350384] [2022-12-14 10:41:54,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:41:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:41:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:41:55,598 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 10:41:55,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:41:55,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103350384] [2022-12-14 10:41:55,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103350384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:41:55,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633948135] [2022-12-14 10:41:55,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:41:55,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:41:55,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:41:55,599 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:41:55,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 10:41:55,956 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:41:55,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:41:55,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-14 10:41:55,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:41:55,985 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-14 10:41:55,985 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 10:41:56,028 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 10:41:56,074 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 10:41:56,130 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 10:41:56,146 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-14 10:41:56,146 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 10:41:56,189 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 10:41:56,298 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 10:41:56,374 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 10:41:56,415 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 10:41:56,501 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 10:41:56,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-12-14 10:41:56,534 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 10:41:56,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:41:56,611 WARN L837 $PredicateComparison]: unable to prove that (and (not (<= |c_ULTIMATE.start_worker_fn_#t~mem26#1| |c_worker_fnThread1of1ForFork0_~tid~0#1|)) (forall ((v_ArrVal_4962 (Array Int Int))) (= |c_worker_fnThread1of1ForFork0_#t~nondet27#1| (select (select (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| v_ArrVal_4962) |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |c_worker_fnThread1of1ForFork0_~tid~0#1|))))) is different from false [2022-12-14 10:41:56,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:56,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 10:41:56,620 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 10:41:57,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:41:57,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:57,101 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 80 [2022-12-14 10:41:57,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:57,124 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 194 treesize of output 194 [2022-12-14 10:41:57,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:57,135 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 142 treesize of output 110 [2022-12-14 10:41:57,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:41:57,143 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 110 treesize of output 94 [2022-12-14 10:41:57,317 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 10:41:57,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633948135] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:41:57,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1645689652] [2022-12-14 10:41:57,318 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 10:41:57,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:41:57,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-12-14 10:41:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875836298] [2022-12-14 10:41:57,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:41:57,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 10:41:57,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:41:57,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 10:41:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1283, Unknown=2, NotChecked=72, Total=1482 [2022-12-14 10:41:57,319 INFO L87 Difference]: Start difference. First operand 73388 states and 152984 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 10:42:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:42:14,153 INFO L93 Difference]: Finished difference Result 75974 states and 158267 transitions. [2022-12-14 10:42:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 10:42:14,153 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 10:42:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:42:14,298 INFO L225 Difference]: With dead ends: 75974 [2022-12-14 10:42:14,298 INFO L226 Difference]: Without dead ends: 75974 [2022-12-14 10:42:14,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=394, Invalid=2470, Unknown=2, NotChecked=104, Total=2970 [2022-12-14 10:42:14,299 INFO L413 NwaCegarLoop]: 505 mSDtfsCounter, 1553 mSDsluCounter, 6628 mSDsCounter, 0 mSdLazyCounter, 13121 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 7133 SdHoareTripleChecker+Invalid, 13867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 13121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 698 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-12-14 10:42:14,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 7133 Invalid, 13867 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 13121 Invalid, 0 Unknown, 698 Unchecked, 14.8s Time] [2022-12-14 10:42:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75974 states. [2022-12-14 10:42:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75974 to 73392. [2022-12-14 10:42:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73392 states, 71208 states have (on average 2.1485226379058533) internal successors, (152992), 73391 states have internal predecessors, (152992), 0 states have call successors, (0), 0 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 10:42:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73392 states to 73392 states and 152992 transitions. [2022-12-14 10:42:15,427 INFO L78 Accepts]: Start accepts. Automaton has 73392 states and 152992 transitions. Word has length 24 [2022-12-14 10:42:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:42:15,427 INFO L495 AbstractCegarLoop]: Abstraction has 73392 states and 152992 transitions. [2022-12-14 10:42:15,427 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 10:42:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 73392 states and 152992 transitions. [2022-12-14 10:42:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:42:15,428 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:42:15,428 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 10:42:15,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 10:42:15,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 10:42:15,630 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:42:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:42:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1908472546, now seen corresponding path program 4 times [2022-12-14 10:42:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:42:15,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724158844] [2022-12-14 10:42:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:42:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:42:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:42:16,408 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 10:42:16,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:42:16,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724158844] [2022-12-14 10:42:16,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724158844] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:42:16,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310851117] [2022-12-14 10:42:16,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:42:16,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:42:16,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:42:16,409 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:42:16,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 10:42:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:42:16,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-14 10:42:16,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:42:16,700 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-14 10:42:16,700 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 10:42:16,755 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 10:42:16,830 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 10:42:16,906 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 10:42:16,926 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 10:42:16,926 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 10:42:16,966 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 10:42:17,171 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 10:42:17,231 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 10:42:17,266 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 10:42:17,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:42:17,348 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 10:42:17,381 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 10:42:17,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:42:17,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:17,573 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 10:42:17,575 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 10:42:17,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:17,955 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 10:42:17,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:17,972 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 10:42:17,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:17,981 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 118 [2022-12-14 10:42:17,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:17,989 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 118 treesize of output 102 [2022-12-14 10:42:18,089 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 10:42:18,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310851117] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:42:18,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1839541146] [2022-12-14 10:42:18,090 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 10:42:18,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:42:18,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-12-14 10:42:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35659036] [2022-12-14 10:42:18,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:42:18,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 10:42:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:42:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 10:42:18,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1335, Unknown=9, NotChecked=0, Total=1482 [2022-12-14 10:42:18,092 INFO L87 Difference]: Start difference. First operand 73392 states and 152992 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 10:42:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:42:36,340 INFO L93 Difference]: Finished difference Result 75986 states and 158291 transitions. [2022-12-14 10:42:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 10:42:36,340 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 10:42:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:42:36,482 INFO L225 Difference]: With dead ends: 75986 [2022-12-14 10:42:36,482 INFO L226 Difference]: Without dead ends: 75986 [2022-12-14 10:42:36,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=481, Invalid=2590, Unknown=9, NotChecked=0, Total=3080 [2022-12-14 10:42:36,483 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 1450 mSDsluCounter, 8157 mSDsCounter, 0 mSdLazyCounter, 15840 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 8688 SdHoareTripleChecker+Invalid, 15884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 15840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:42:36,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 8688 Invalid, 15884 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 15840 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2022-12-14 10:42:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75986 states. [2022-12-14 10:42:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75986 to 73402. [2022-12-14 10:42:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73402 states, 71218 states have (on average 2.148501783257042) internal successors, (153012), 73401 states have internal predecessors, (153012), 0 states have call successors, (0), 0 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 10:42:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73402 states to 73402 states and 153012 transitions. [2022-12-14 10:42:37,605 INFO L78 Accepts]: Start accepts. Automaton has 73402 states and 153012 transitions. Word has length 24 [2022-12-14 10:42:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:42:37,605 INFO L495 AbstractCegarLoop]: Abstraction has 73402 states and 153012 transitions. [2022-12-14 10:42:37,605 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 10:42:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 73402 states and 153012 transitions. [2022-12-14 10:42:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:42:37,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:42:37,606 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 10:42:37,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 10:42:37,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 10:42:37,808 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:42:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:42:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash -978873522, now seen corresponding path program 5 times [2022-12-14 10:42:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:42:37,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803689003] [2022-12-14 10:42:37,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:42:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:42:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:42:38,474 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 10:42:38,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:42:38,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803689003] [2022-12-14 10:42:38,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803689003] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:42:38,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760128188] [2022-12-14 10:42:38,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:42:38,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:42:38,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:42:38,476 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:42:38,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 10:42:39,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:42:39,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:42:39,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-14 10:42:39,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:42:39,683 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:42:39,683 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 10:42:39,717 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 10:42:39,749 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 10:42:39,785 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:42:39,786 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 10:42:39,790 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 10:42:39,818 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 10:42:39,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:39,947 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 10:42:40,009 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 10:42:40,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:42:40,044 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 10:42:40,065 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 10:42:40,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:42:40,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:40,364 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 10:42:40,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:40,380 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 10:42:40,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:40,389 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 10:42:40,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:42:40,395 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 10:42:40,491 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 10:42:40,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760128188] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:42:40,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1047127430] [2022-12-14 10:42:40,492 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 10:42:40,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:42:40,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-12-14 10:42:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705552144] [2022-12-14 10:42:40,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:42:40,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 10:42:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:42:40,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 10:42:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1071, Unknown=11, NotChecked=0, Total=1190 [2022-12-14 10:42:40,493 INFO L87 Difference]: Start difference. First operand 73402 states and 153012 transitions. Second operand has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 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 10:43:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:43:05,279 INFO L93 Difference]: Finished difference Result 144947 states and 302327 transitions. [2022-12-14 10:43:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 10:43:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 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 10:43:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:43:05,649 INFO L225 Difference]: With dead ends: 144947 [2022-12-14 10:43:05,649 INFO L226 Difference]: Without dead ends: 144947 [2022-12-14 10:43:05,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=581, Invalid=2947, Unknown=12, NotChecked=0, Total=3540 [2022-12-14 10:43:05,650 INFO L413 NwaCegarLoop]: 848 mSDtfsCounter, 3094 mSDsluCounter, 15724 mSDsCounter, 0 mSdLazyCounter, 29996 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3094 SdHoareTripleChecker+Valid, 16572 SdHoareTripleChecker+Invalid, 30047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 29996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:43:05,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3094 Valid, 16572 Invalid, 30047 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 29996 Invalid, 0 Unknown, 0 Unchecked, 22.9s Time] [2022-12-14 10:43:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144947 states. [2022-12-14 10:43:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144947 to 73406. [2022-12-14 10:43:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73406 states, 71222 states have (on average 2.148493443037264) internal successors, (153020), 73405 states have internal predecessors, (153020), 0 states have call successors, (0), 0 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 10:43:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73406 states to 73406 states and 153020 transitions. [2022-12-14 10:43:07,171 INFO L78 Accepts]: Start accepts. Automaton has 73406 states and 153020 transitions. Word has length 24 [2022-12-14 10:43:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:43:07,172 INFO L495 AbstractCegarLoop]: Abstraction has 73406 states and 153020 transitions. [2022-12-14 10:43:07,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 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 10:43:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 73406 states and 153020 transitions. [2022-12-14 10:43:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:43:07,173 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:43:07,173 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 10:43:07,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 10:43:07,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 10:43:07,374 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:43:07,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:43:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash -956562769, now seen corresponding path program 4 times [2022-12-14 10:43:07,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:43:07,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602904864] [2022-12-14 10:43:07,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:43:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:43:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:43:08,028 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 10:43:08,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:43:08,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602904864] [2022-12-14 10:43:08,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602904864] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:43:08,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217768658] [2022-12-14 10:43:08,029 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:43:08,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:43:08,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:43:08,030 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:43:08,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 10:43:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:43:08,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 10:43:08,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:43:08,387 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 10:43:08,388 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 10:43:08,411 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 10:43:08,444 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 10:43:08,483 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:43:08,483 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 10:43:08,489 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 10:43:08,521 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 10:43:08,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:08,685 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 10:43:08,753 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 10:43:08,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:43:08,782 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 10:43:08,810 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 10:43:08,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:43:09,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:09,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 1 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 83 [2022-12-14 10:43:09,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:09,130 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 10:43:09,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:09,139 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 10:43:09,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:09,145 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 10:43:09,236 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 10:43:09,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217768658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:43:09,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [787110325] [2022-12-14 10:43:09,237 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 10:43:09,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:43:09,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-12-14 10:43:09,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521043152] [2022-12-14 10:43:09,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:43:09,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 10:43:09,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:43:09,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 10:43:09,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1143, Unknown=5, NotChecked=0, Total=1260 [2022-12-14 10:43:09,239 INFO L87 Difference]: Start difference. First operand 73406 states and 153020 transitions. Second operand has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 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 10:43:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:43:32,791 INFO L93 Difference]: Finished difference Result 144936 states and 302305 transitions. [2022-12-14 10:43:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 10:43:32,792 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 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 10:43:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:43:33,100 INFO L225 Difference]: With dead ends: 144936 [2022-12-14 10:43:33,100 INFO L226 Difference]: Without dead ends: 144936 [2022-12-14 10:43:33,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=520, Invalid=2897, Unknown=5, NotChecked=0, Total=3422 [2022-12-14 10:43:33,101 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 2703 mSDsluCounter, 17095 mSDsCounter, 0 mSdLazyCounter, 28106 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2703 SdHoareTripleChecker+Valid, 17947 SdHoareTripleChecker+Invalid, 28153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 28106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:43:33,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2703 Valid, 17947 Invalid, 28153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 28106 Invalid, 0 Unknown, 0 Unchecked, 21.9s Time] [2022-12-14 10:43:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144936 states. [2022-12-14 10:43:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144936 to 73392. [2022-12-14 10:43:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73392 states, 71208 states have (on average 2.1485226379058533) internal successors, (152992), 73391 states have internal predecessors, (152992), 0 states have call successors, (0), 0 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 10:43:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73392 states to 73392 states and 152992 transitions. [2022-12-14 10:43:34,670 INFO L78 Accepts]: Start accepts. Automaton has 73392 states and 152992 transitions. Word has length 24 [2022-12-14 10:43:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:43:34,670 INFO L495 AbstractCegarLoop]: Abstraction has 73392 states and 152992 transitions. [2022-12-14 10:43:34,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 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 10:43:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 73392 states and 152992 transitions. [2022-12-14 10:43:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:43:34,671 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:43:34,671 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 10:43:34,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 10:43:34,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:43:34,873 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 140 more)] === [2022-12-14 10:43:34,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:43:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash -866131901, now seen corresponding path program 5 times [2022-12-14 10:43:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:43:34,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127906534] [2022-12-14 10:43:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:43:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:43:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:43:35,752 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 10:43:35,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:43:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127906534] [2022-12-14 10:43:35,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127906534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:43:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695346940] [2022-12-14 10:43:35,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:43:35,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:43:35,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:43:35,753 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:43:35,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed769796-53ba-41d0-9bb3-df8d7bd5d240/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 10:43:36,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:43:36,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:43:36,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-14 10:43:36,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:43:36,994 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-14 10:43:36,994 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 10:43:37,035 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 10:43:37,099 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 10:43:37,142 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 10:43:37,156 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-14 10:43:37,156 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 10:43:37,202 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 10:43:37,320 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 10:43:37,396 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 10:43:37,432 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 10:43:37,438 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 10:43:37,447 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 10:43:37,464 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 10:43:37,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:43:37,550 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 10:43:37,582 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 10:43:37,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:43:37,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:37,719 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 10:43:37,721 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 10:43:38,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:38,079 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 10:43:38,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:38,097 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 10:43:38,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:38,115 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 10:43:38,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:43:38,122 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 10:43:38,214 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 10:43:38,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695346940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:43:38,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248128136] [2022-12-14 10:43:38,215 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 10:43:38,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:43:38,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2022-12-14 10:43:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054614557] [2022-12-14 10:43:38,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:43:38,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 10:43:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:43:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 10:43:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1407, Unknown=11, NotChecked=0, Total=1560 [2022-12-14 10:43:38,217 INFO L87 Difference]: Start difference. First operand 73392 states and 152992 transitions. Second operand has 40 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 39 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)