./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --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_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/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_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/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_4ac52070-de8d-41ae-8e17-69d186bf958b/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 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f --- 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 03:09:38,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 03:09:38,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 03:09:38,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 03:09:38,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 03:09:38,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 03:09:38,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 03:09:38,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 03:09:38,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 03:09:38,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 03:09:38,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 03:09:38,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 03:09:38,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 03:09:38,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 03:09:38,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 03:09:38,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 03:09:38,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 03:09:38,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 03:09:38,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 03:09:38,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 03:09:38,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 03:09:38,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 03:09:38,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 03:09:38,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 03:09:38,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 03:09:38,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 03:09:38,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 03:09:38,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 03:09:38,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 03:09:38,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 03:09:38,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 03:09:38,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 03:09:38,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 03:09:38,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 03:09:38,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 03:09:38,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 03:09:38,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 03:09:38,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 03:09:38,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 03:09:38,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 03:09:38,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 03:09:38,292 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-12-14 03:09:38,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 03:09:38,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 03:09:38,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 03:09:38,305 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 03:09:38,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 03:09:38,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 03:09:38,306 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 03:09:38,306 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 03:09:38,306 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 03:09:38,306 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 03:09:38,306 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 03:09:38,307 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 03:09:38,307 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 03:09:38,307 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 03:09:38,307 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 03:09:38,307 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 03:09:38,307 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 03:09:38,307 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 03:09:38,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-14 03:09:38,308 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 03:09:38,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 03:09:38,309 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 03:09:38,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 03:09:38,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 03:09:38,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 03:09:38,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:09:38,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 03:09:38,309 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 03:09:38,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 03:09:38,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 03:09:38,309 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 03:09:38,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 03:09:38,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 03:09:38,310 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 03:09:38,310 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_4ac52070-de8d-41ae-8e17-69d186bf958b/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_4ac52070-de8d-41ae-8e17-69d186bf958b/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 -> 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f [2022-12-14 03:09:38,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 03:09:38,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 03:09:38,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 03:09:38,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 03:09:38,541 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 03:09:38,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-12-14 03:09:41,138 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 03:09:41,299 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 03:09:41,300 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-12-14 03:09:41,306 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/data/8538fbedc/8718f020d8234f33b0b4a187c9c645c0/FLAGa8d7a587d [2022-12-14 03:09:41,318 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/data/8538fbedc/8718f020d8234f33b0b4a187c9c645c0 [2022-12-14 03:09:41,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 03:09:41,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 03:09:41,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 03:09:41,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 03:09:41,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 03:09:41,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e97ae3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41, skipping insertion in model container [2022-12-14 03:09:41,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 03:09:41,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 03:09:41,510 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_4ac52070-de8d-41ae-8e17-69d186bf958b/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-12-14 03:09:41,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:09:41,527 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 03:09:41,557 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_4ac52070-de8d-41ae-8e17-69d186bf958b/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-12-14 03:09:41,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:09:41,577 INFO L208 MainTranslator]: Completed translation [2022-12-14 03:09:41,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41 WrapperNode [2022-12-14 03:09:41,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 03:09:41,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 03:09:41,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 03:09:41,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 03:09:41,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,636 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 403 [2022-12-14 03:09:41,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 03:09:41,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 03:09:41,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 03:09:41,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 03:09:41,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 03:09:41,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 03:09:41,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 03:09:41,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 03:09:41,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (1/1) ... [2022-12-14 03:09:41,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:09:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:09:41,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 03:09:41,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 03:09:41,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 03:09:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 03:09:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 03:09:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 03:09:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 03:09:41,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 03:09:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 03:09:41,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 03:09:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 03:09:41,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 03:09:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 03:09:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 03:09:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 03:09:41,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 03:09:41,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 03:09:41,770 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 03:09:41,866 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 03:09:41,868 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 03:09:42,401 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 03:09:42,410 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 03:09:42,411 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 03:09:42,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:09:42 BoogieIcfgContainer [2022-12-14 03:09:42,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 03:09:42,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 03:09:42,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 03:09:42,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 03:09:42,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:09:41" (1/3) ... [2022-12-14 03:09:42,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60988869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:09:42, skipping insertion in model container [2022-12-14 03:09:42,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:09:41" (2/3) ... [2022-12-14 03:09:42,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60988869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:09:42, skipping insertion in model container [2022-12-14 03:09:42,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:09:42" (3/3) ... [2022-12-14 03:09:42,419 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-12-14 03:09:42,427 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 03:09:42,437 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 03:09:42,437 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-12-14 03:09:42,437 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 03:09:42,551 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-14 03:09:42,581 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 03:09:42,592 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 517 places, 536 transitions, 1096 flow [2022-12-14 03:09:42,594 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 517 places, 536 transitions, 1096 flow [2022-12-14 03:09:42,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 517 places, 536 transitions, 1096 flow [2022-12-14 03:09:42,734 INFO L130 PetriNetUnfolder]: 29/533 cut-off events. [2022-12-14 03:09:42,734 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-14 03:09:42,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 533 events. 29/533 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 916 event pairs, 0 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 332. Up to 2 conditions per place. [2022-12-14 03:09:42,775 INFO L119 LiptonReduction]: Number of co-enabled transitions 47072 [2022-12-14 03:09:55,269 INFO L134 LiptonReduction]: Checked pairs total: 212759 [2022-12-14 03:09:55,269 INFO L136 LiptonReduction]: Total number of compositions: 629 [2022-12-14 03:09:55,275 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 122 transitions, 268 flow [2022-12-14 03:09:56,837 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 67979 states, 67019 states have (on average 4.048329578179322) internal successors, (271315), 67978 states have internal predecessors, (271315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:56,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 03:09:56,860 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;@413bac91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 03:09:56,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-12-14 03:09:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 67979 states, 67019 states have (on average 4.048329578179322) internal successors, (271315), 67978 states have internal predecessors, (271315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 03:09:56,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:56,930 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 03:09:56,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:09:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2067, now seen corresponding path program 1 times [2022-12-14 03:09:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:56,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735018472] [2022-12-14 03:09:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:57,024 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 03:09:57,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:57,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735018472] [2022-12-14 03:09:57,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735018472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:57,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:57,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 03:09:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418117777] [2022-12-14 03:09:57,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:57,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 03:09:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 03:09:57,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 03:09:57,135 INFO L87 Difference]: Start difference. First operand has 67979 states, 67019 states have (on average 4.048329578179322) internal successors, (271315), 67978 states have internal predecessors, (271315), 0 states have call successors, (0), 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 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:09:57,695 INFO L93 Difference]: Finished difference Result 30062 states and 113647 transitions. [2022-12-14 03:09:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 03:09:57,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-12-14 03:09:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:09:57,881 INFO L225 Difference]: With dead ends: 30062 [2022-12-14 03:09:57,881 INFO L226 Difference]: Without dead ends: 30060 [2022-12-14 03:09:57,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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 03:09:57,884 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:09:57,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:09:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30060 states. [2022-12-14 03:09:58,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30060 to 30060. [2022-12-14 03:09:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30060 states, 30006 states have (on average 3.787375858161701) internal successors, (113644), 30059 states have internal predecessors, (113644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30060 states to 30060 states and 113644 transitions. [2022-12-14 03:09:59,257 INFO L78 Accepts]: Start accepts. Automaton has 30060 states and 113644 transitions. Word has length 1 [2022-12-14 03:09:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:09:59,257 INFO L495 AbstractCegarLoop]: Abstraction has 30060 states and 113644 transitions. [2022-12-14 03:09:59,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:09:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 30060 states and 113644 transitions. [2022-12-14 03:09:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 03:09:59,262 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:09:59,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:09:59,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 03:09:59,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:09:59,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:09:59,263 INFO L85 PathProgramCache]: Analyzing trace with hash 979781427, now seen corresponding path program 1 times [2022-12-14 03:09:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:09:59,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611744080] [2022-12-14 03:09:59,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:09:59,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:09:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:09:59,710 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 03:09:59,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:09:59,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611744080] [2022-12-14 03:09:59,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611744080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:09:59,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:09:59,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 03:09:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133903655] [2022-12-14 03:09:59,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:09:59,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:09:59,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:09:59,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:09:59,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:09:59,713 INFO L87 Difference]: Start difference. First operand 30060 states and 113644 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 03:10:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:00,612 INFO L93 Difference]: Finished difference Result 39452 states and 150061 transitions. [2022-12-14 03:10:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:10:00,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 03:10:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:00,816 INFO L225 Difference]: With dead ends: 39452 [2022-12-14 03:10:00,816 INFO L226 Difference]: Without dead ends: 39452 [2022-12-14 03:10:00,817 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 03:10:00,818 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 92 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:00,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 86 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 03:10:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39452 states. [2022-12-14 03:10:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39452 to 39452. [2022-12-14 03:10:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39452 states, 39398 states have (on average 3.808848164881466) internal successors, (150061), 39451 states have internal predecessors, (150061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39452 states to 39452 states and 150061 transitions. [2022-12-14 03:10:01,929 INFO L78 Accepts]: Start accepts. Automaton has 39452 states and 150061 transitions. Word has length 14 [2022-12-14 03:10:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:01,930 INFO L495 AbstractCegarLoop]: Abstraction has 39452 states and 150061 transitions. [2022-12-14 03:10:01,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 03:10:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 39452 states and 150061 transitions. [2022-12-14 03:10:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 03:10:01,933 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:01,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:01,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 03:10:01,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:01,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1996804791, now seen corresponding path program 1 times [2022-12-14 03:10:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:01,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976550544] [2022-12-14 03:10:01,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:02,202 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 03:10:02,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:02,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976550544] [2022-12-14 03:10:02,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976550544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:02,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:02,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 03:10:02,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139290715] [2022-12-14 03:10:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:02,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:10:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:02,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:10:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:10:02,204 INFO L87 Difference]: Start difference. First operand 39452 states and 150061 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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 03:10:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:03,178 INFO L93 Difference]: Finished difference Result 64208 states and 241824 transitions. [2022-12-14 03:10:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:10:03,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 03:10:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:03,466 INFO L225 Difference]: With dead ends: 64208 [2022-12-14 03:10:03,466 INFO L226 Difference]: Without dead ends: 64208 [2022-12-14 03:10:03,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 03:10:03,467 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 110 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:03,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 91 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:10:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64208 states. [2022-12-14 03:10:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64208 to 57162. [2022-12-14 03:10:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57162 states, 57108 states have (on average 3.868127057505078) internal successors, (220901), 57161 states have internal predecessors, (220901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57162 states to 57162 states and 220901 transitions. [2022-12-14 03:10:05,002 INFO L78 Accepts]: Start accepts. Automaton has 57162 states and 220901 transitions. Word has length 15 [2022-12-14 03:10:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:05,003 INFO L495 AbstractCegarLoop]: Abstraction has 57162 states and 220901 transitions. [2022-12-14 03:10:05,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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 03:10:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 57162 states and 220901 transitions. [2022-12-14 03:10:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 03:10:05,005 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:05,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:05,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 03:10:05,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:05,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash 316303974, now seen corresponding path program 1 times [2022-12-14 03:10:05,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:05,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742549918] [2022-12-14 03:10:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:05,139 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 03:10:05,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:05,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742549918] [2022-12-14 03:10:05,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742549918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:05,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:05,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:10:05,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813935823] [2022-12-14 03:10:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:05,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:10:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:10:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:10:05,142 INFO L87 Difference]: Start difference. First operand 57162 states and 220901 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:05,905 INFO L93 Difference]: Finished difference Result 60871 states and 233742 transitions. [2022-12-14 03:10:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:10:05,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 03:10:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:06,133 INFO L225 Difference]: With dead ends: 60871 [2022-12-14 03:10:06,133 INFO L226 Difference]: Without dead ends: 60868 [2022-12-14 03:10:06,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 03:10:06,134 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 141 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:06,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 201 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:10:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60868 states. [2022-12-14 03:10:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60868 to 60003. [2022-12-14 03:10:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60003 states, 59949 states have (on average 3.859180303257769) internal successors, (231354), 60002 states have internal predecessors, (231354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60003 states to 60003 states and 231354 transitions. [2022-12-14 03:10:07,750 INFO L78 Accepts]: Start accepts. Automaton has 60003 states and 231354 transitions. Word has length 16 [2022-12-14 03:10:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:07,750 INFO L495 AbstractCegarLoop]: Abstraction has 60003 states and 231354 transitions. [2022-12-14 03:10:07,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 60003 states and 231354 transitions. [2022-12-14 03:10:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 03:10:07,752 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:07,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:07,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 03:10:07,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2073863022, now seen corresponding path program 1 times [2022-12-14 03:10:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:07,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92061144] [2022-12-14 03:10:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:07,844 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 03:10:07,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:07,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92061144] [2022-12-14 03:10:07,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92061144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:07,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:07,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:10:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507773677] [2022-12-14 03:10:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:07,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:10:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:10:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:10:07,846 INFO L87 Difference]: Start difference. First operand 60003 states and 231354 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:08,362 INFO L93 Difference]: Finished difference Result 58544 states and 225299 transitions. [2022-12-14 03:10:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:10:08,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 03:10:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:08,578 INFO L225 Difference]: With dead ends: 58544 [2022-12-14 03:10:08,579 INFO L226 Difference]: Without dead ends: 58544 [2022-12-14 03:10:08,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 03:10:08,579 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 118 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:08,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 179 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:10:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58544 states. [2022-12-14 03:10:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58544 to 58459. [2022-12-14 03:10:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58459 states, 58405 states have (on average 3.855046656964301) internal successors, (225154), 58458 states have internal predecessors, (225154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58459 states to 58459 states and 225154 transitions. [2022-12-14 03:10:09,913 INFO L78 Accepts]: Start accepts. Automaton has 58459 states and 225154 transitions. Word has length 16 [2022-12-14 03:10:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:09,914 INFO L495 AbstractCegarLoop]: Abstraction has 58459 states and 225154 transitions. [2022-12-14 03:10:09,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 58459 states and 225154 transitions. [2022-12-14 03:10:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 03:10:09,918 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:09,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:09,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 03:10:09,918 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash 287761856, now seen corresponding path program 1 times [2022-12-14 03:10:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:09,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682694068] [2022-12-14 03:10:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:10,358 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 03:10:10,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:10,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682694068] [2022-12-14 03:10:10,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682694068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:10,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:10,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:10:10,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171281754] [2022-12-14 03:10:10,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:10,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:10:10,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:10,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:10:10,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:10:10,360 INFO L87 Difference]: Start difference. First operand 58459 states and 225154 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:11,147 INFO L93 Difference]: Finished difference Result 56383 states and 217119 transitions. [2022-12-14 03:10:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:10:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 03:10:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:11,500 INFO L225 Difference]: With dead ends: 56383 [2022-12-14 03:10:11,500 INFO L226 Difference]: Without dead ends: 56383 [2022-12-14 03:10:11,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:10:11,501 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 81 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:11,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 66 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 03:10:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56383 states. [2022-12-14 03:10:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56383 to 56383. [2022-12-14 03:10:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56383 states, 56340 states have (on average 3.853727369542066) internal successors, (217119), 56382 states have internal predecessors, (217119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56383 states to 56383 states and 217119 transitions. [2022-12-14 03:10:12,772 INFO L78 Accepts]: Start accepts. Automaton has 56383 states and 217119 transitions. Word has length 19 [2022-12-14 03:10:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:12,772 INFO L495 AbstractCegarLoop]: Abstraction has 56383 states and 217119 transitions. [2022-12-14 03:10:12,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 56383 states and 217119 transitions. [2022-12-14 03:10:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 03:10:12,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:12,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:12,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 03:10:12,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2045320904, now seen corresponding path program 1 times [2022-12-14 03:10:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:12,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371124937] [2022-12-14 03:10:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:12,998 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 03:10:12,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:12,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371124937] [2022-12-14 03:10:12,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371124937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:12,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:12,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 03:10:12,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807888827] [2022-12-14 03:10:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:12,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:10:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:10:13,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:10:13,000 INFO L87 Difference]: Start difference. First operand 56383 states and 217119 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:14,302 INFO L93 Difference]: Finished difference Result 75837 states and 292581 transitions. [2022-12-14 03:10:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:10:14,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 03:10:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:14,635 INFO L225 Difference]: With dead ends: 75837 [2022-12-14 03:10:14,635 INFO L226 Difference]: Without dead ends: 75837 [2022-12-14 03:10:14,635 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 03:10:14,636 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 100 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:14,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 82 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 03:10:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75837 states. [2022-12-14 03:10:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75837 to 75837. [2022-12-14 03:10:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75837 states, 75794 states have (on average 3.8602132094888777) internal successors, (292581), 75836 states have internal predecessors, (292581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75837 states to 75837 states and 292581 transitions. [2022-12-14 03:10:16,460 INFO L78 Accepts]: Start accepts. Automaton has 75837 states and 292581 transitions. Word has length 19 [2022-12-14 03:10:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:16,461 INFO L495 AbstractCegarLoop]: Abstraction has 75837 states and 292581 transitions. [2022-12-14 03:10:16,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 75837 states and 292581 transitions. [2022-12-14 03:10:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 03:10:16,473 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:16,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:16,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 03:10:16,474 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:16,474 INFO L85 PathProgramCache]: Analyzing trace with hash -556917964, now seen corresponding path program 1 times [2022-12-14 03:10:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:16,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74360598] [2022-12-14 03:10:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:16,747 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 03:10:16,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:16,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74360598] [2022-12-14 03:10:16,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74360598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:16,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:16,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:10:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831523000] [2022-12-14 03:10:16,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:16,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:10:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:10:16,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:10:16,749 INFO L87 Difference]: Start difference. First operand 75837 states and 292581 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:17,694 INFO L93 Difference]: Finished difference Result 73009 states and 281630 transitions. [2022-12-14 03:10:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:10:17,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 03:10:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:17,961 INFO L225 Difference]: With dead ends: 73009 [2022-12-14 03:10:17,961 INFO L226 Difference]: Without dead ends: 73009 [2022-12-14 03:10:17,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:10:17,962 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:17,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 78 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:10:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73009 states. [2022-12-14 03:10:19,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73009 to 73009. [2022-12-14 03:10:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73009 states, 72977 states have (on average 3.8591611055538046) internal successors, (281630), 73008 states have internal predecessors, (281630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73009 states to 73009 states and 281630 transitions. [2022-12-14 03:10:19,934 INFO L78 Accepts]: Start accepts. Automaton has 73009 states and 281630 transitions. Word has length 24 [2022-12-14 03:10:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:19,934 INFO L495 AbstractCegarLoop]: Abstraction has 73009 states and 281630 transitions. [2022-12-14 03:10:19,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 73009 states and 281630 transitions. [2022-12-14 03:10:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 03:10:19,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:19,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:19,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 03:10:19,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1424810773, now seen corresponding path program 1 times [2022-12-14 03:10:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636043931] [2022-12-14 03:10:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:20,356 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 03:10:20,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:20,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636043931] [2022-12-14 03:10:20,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636043931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:20,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:20,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 03:10:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192416485] [2022-12-14 03:10:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:20,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:10:20,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:10:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:10:20,359 INFO L87 Difference]: Start difference. First operand 73009 states and 281630 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:21,152 INFO L93 Difference]: Finished difference Result 75058 states and 287209 transitions. [2022-12-14 03:10:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:10:21,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 03:10:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:21,425 INFO L225 Difference]: With dead ends: 75058 [2022-12-14 03:10:21,425 INFO L226 Difference]: Without dead ends: 75058 [2022-12-14 03:10:21,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 03:10:21,426 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:21,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 75 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 03:10:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75058 states. [2022-12-14 03:10:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75058 to 74484. [2022-12-14 03:10:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74484 states, 74452 states have (on average 3.8422204910546394) internal successors, (286061), 74483 states have internal predecessors, (286061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74484 states to 74484 states and 286061 transitions. [2022-12-14 03:10:23,448 INFO L78 Accepts]: Start accepts. Automaton has 74484 states and 286061 transitions. Word has length 25 [2022-12-14 03:10:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:23,448 INFO L495 AbstractCegarLoop]: Abstraction has 74484 states and 286061 transitions. [2022-12-14 03:10:23,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 74484 states and 286061 transitions. [2022-12-14 03:10:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 03:10:23,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:23,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:23,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 03:10:23,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2126921833, now seen corresponding path program 1 times [2022-12-14 03:10:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:23,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817612862] [2022-12-14 03:10:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:23,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:23,916 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 03:10:23,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:23,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817612862] [2022-12-14 03:10:23,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817612862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:23,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:23,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 03:10:23,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365537167] [2022-12-14 03:10:23,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:23,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:10:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:23,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:10:23,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:10:23,918 INFO L87 Difference]: Start difference. First operand 74484 states and 286061 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:24,764 INFO L93 Difference]: Finished difference Result 81592 states and 313176 transitions. [2022-12-14 03:10:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:10:24,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 03:10:24,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:25,239 INFO L225 Difference]: With dead ends: 81592 [2022-12-14 03:10:25,239 INFO L226 Difference]: Without dead ends: 81592 [2022-12-14 03:10:25,239 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 03:10:25,239 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 103 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:25,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 80 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 03:10:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81592 states. [2022-12-14 03:10:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81592 to 78718. [2022-12-14 03:10:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78718 states, 78686 states have (on average 3.8392979691431766) internal successors, (302099), 78717 states have internal predecessors, (302099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78718 states to 78718 states and 302099 transitions. [2022-12-14 03:10:27,103 INFO L78 Accepts]: Start accepts. Automaton has 78718 states and 302099 transitions. Word has length 30 [2022-12-14 03:10:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:27,103 INFO L495 AbstractCegarLoop]: Abstraction has 78718 states and 302099 transitions. [2022-12-14 03:10:27,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 78718 states and 302099 transitions. [2022-12-14 03:10:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 03:10:27,127 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:27,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:27,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 03:10:27,127 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -299241625, now seen corresponding path program 1 times [2022-12-14 03:10:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:27,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329538164] [2022-12-14 03:10:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:27,737 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 03:10:27,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:27,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329538164] [2022-12-14 03:10:27,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329538164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:27,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:27,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 03:10:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241637270] [2022-12-14 03:10:27,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:27,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 03:10:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:27,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 03:10:27,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-14 03:10:27,739 INFO L87 Difference]: Start difference. First operand 78718 states and 302099 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:28,900 INFO L93 Difference]: Finished difference Result 72609 states and 277663 transitions. [2022-12-14 03:10:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:10:28,901 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 03:10:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:29,152 INFO L225 Difference]: With dead ends: 72609 [2022-12-14 03:10:29,152 INFO L226 Difference]: Without dead ends: 72609 [2022-12-14 03:10:29,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-12-14 03:10:29,152 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 354 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:29,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 78 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:10:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72609 states. [2022-12-14 03:10:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72609 to 50113. [2022-12-14 03:10:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50113 states, 50093 states have (on average 3.7466113029764636) internal successors, (187679), 50112 states have internal predecessors, (187679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50113 states to 50113 states and 187679 transitions. [2022-12-14 03:10:30,424 INFO L78 Accepts]: Start accepts. Automaton has 50113 states and 187679 transitions. Word has length 32 [2022-12-14 03:10:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:30,425 INFO L495 AbstractCegarLoop]: Abstraction has 50113 states and 187679 transitions. [2022-12-14 03:10:30,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 50113 states and 187679 transitions. [2022-12-14 03:10:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 03:10:30,577 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:30,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:30,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 03:10:30,577 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:30,578 INFO L85 PathProgramCache]: Analyzing trace with hash 757488046, now seen corresponding path program 1 times [2022-12-14 03:10:30,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:30,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189407795] [2022-12-14 03:10:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:30,906 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 03:10:30,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:30,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189407795] [2022-12-14 03:10:30,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189407795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:30,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:30,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 03:10:30,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942882436] [2022-12-14 03:10:30,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:30,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:10:30,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:30,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:10:30,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:10:30,908 INFO L87 Difference]: Start difference. First operand 50113 states and 187679 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:31,812 INFO L93 Difference]: Finished difference Result 54314 states and 203548 transitions. [2022-12-14 03:10:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:10:31,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 03:10:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:31,998 INFO L225 Difference]: With dead ends: 54314 [2022-12-14 03:10:31,998 INFO L226 Difference]: Without dead ends: 54314 [2022-12-14 03:10:31,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-12-14 03:10:31,999 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 334 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:31,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 82 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 03:10:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54314 states. [2022-12-14 03:10:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54314 to 50073. [2022-12-14 03:10:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50073 states, 50053 states have (on average 3.7465686372445206) internal successors, (187527), 50072 states have internal predecessors, (187527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50073 states to 50073 states and 187527 transitions. [2022-12-14 03:10:33,575 INFO L78 Accepts]: Start accepts. Automaton has 50073 states and 187527 transitions. Word has length 32 [2022-12-14 03:10:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:33,575 INFO L495 AbstractCegarLoop]: Abstraction has 50073 states and 187527 transitions. [2022-12-14 03:10:33,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 50073 states and 187527 transitions. [2022-12-14 03:10:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 03:10:33,595 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:33,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:33,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 03:10:33,596 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1289510368, now seen corresponding path program 1 times [2022-12-14 03:10:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:33,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724422976] [2022-12-14 03:10:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:33,801 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 03:10:33,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:33,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724422976] [2022-12-14 03:10:33,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724422976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:33,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:33,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:10:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425117130] [2022-12-14 03:10:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:33,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:10:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:33,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:10:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:10:33,803 INFO L87 Difference]: Start difference. First operand 50073 states and 187527 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:34,460 INFO L93 Difference]: Finished difference Result 48310 states and 180896 transitions. [2022-12-14 03:10:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:10:34,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 03:10:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:34,611 INFO L225 Difference]: With dead ends: 48310 [2022-12-14 03:10:34,611 INFO L226 Difference]: Without dead ends: 48287 [2022-12-14 03:10:34,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:10:34,612 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 72 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:34,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 82 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 03:10:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48287 states. [2022-12-14 03:10:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48287 to 48287. [2022-12-14 03:10:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48287 states, 48274 states have (on average 3.7463023573766416) internal successors, (180849), 48286 states have internal predecessors, (180849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48287 states to 48287 states and 180849 transitions. [2022-12-14 03:10:35,649 INFO L78 Accepts]: Start accepts. Automaton has 48287 states and 180849 transitions. Word has length 34 [2022-12-14 03:10:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:35,650 INFO L495 AbstractCegarLoop]: Abstraction has 48287 states and 180849 transitions. [2022-12-14 03:10:35,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 48287 states and 180849 transitions. [2022-12-14 03:10:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 03:10:35,670 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:35,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:35,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 03:10:35,670 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1470506831, now seen corresponding path program 1 times [2022-12-14 03:10:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:35,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946431115] [2022-12-14 03:10:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:35,984 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 03:10:35,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:35,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946431115] [2022-12-14 03:10:35,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946431115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:35,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:35,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 03:10:35,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736777165] [2022-12-14 03:10:35,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:35,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:10:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:35,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:10:35,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:10:35,986 INFO L87 Difference]: Start difference. First operand 48287 states and 180849 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:36,492 INFO L93 Difference]: Finished difference Result 48382 states and 181015 transitions. [2022-12-14 03:10:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:10:36,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 03:10:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:36,636 INFO L225 Difference]: With dead ends: 48382 [2022-12-14 03:10:36,636 INFO L226 Difference]: Without dead ends: 46330 [2022-12-14 03:10:36,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 03:10:36,637 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 38 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:36,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 70 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 03:10:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46330 states. [2022-12-14 03:10:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46330 to 46326. [2022-12-14 03:10:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46326 states, 46313 states have (on average 3.751171377367046) internal successors, (173728), 46325 states have internal predecessors, (173728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46326 states to 46326 states and 173728 transitions. [2022-12-14 03:10:37,757 INFO L78 Accepts]: Start accepts. Automaton has 46326 states and 173728 transitions. Word has length 35 [2022-12-14 03:10:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:37,758 INFO L495 AbstractCegarLoop]: Abstraction has 46326 states and 173728 transitions. [2022-12-14 03:10:37,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 46326 states and 173728 transitions. [2022-12-14 03:10:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 03:10:37,773 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:37,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:37,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 03:10:37,774 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1192112359, now seen corresponding path program 1 times [2022-12-14 03:10:37,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:37,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326269453] [2022-12-14 03:10:37,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:38,067 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 03:10:38,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:38,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326269453] [2022-12-14 03:10:38,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326269453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:38,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:38,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 03:10:38,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976343044] [2022-12-14 03:10:38,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:38,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 03:10:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:38,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 03:10:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 03:10:38,069 INFO L87 Difference]: Start difference. First operand 46326 states and 173728 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:39,569 INFO L93 Difference]: Finished difference Result 155484 states and 583368 transitions. [2022-12-14 03:10:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:10:39,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 03:10:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:40,145 INFO L225 Difference]: With dead ends: 155484 [2022-12-14 03:10:40,145 INFO L226 Difference]: Without dead ends: 155176 [2022-12-14 03:10:40,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-12-14 03:10:40,145 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 484 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:40,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 144 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:10:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155176 states. [2022-12-14 03:10:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155176 to 70270. [2022-12-14 03:10:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70270 states, 70257 states have (on average 3.815634029349389) internal successors, (268075), 70269 states have internal predecessors, (268075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70270 states to 70270 states and 268075 transitions. [2022-12-14 03:10:42,624 INFO L78 Accepts]: Start accepts. Automaton has 70270 states and 268075 transitions. Word has length 35 [2022-12-14 03:10:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:42,624 INFO L495 AbstractCegarLoop]: Abstraction has 70270 states and 268075 transitions. [2022-12-14 03:10:42,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 70270 states and 268075 transitions. [2022-12-14 03:10:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 03:10:42,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:42,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:42,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 03:10:42,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash 105337799, now seen corresponding path program 1 times [2022-12-14 03:10:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:42,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18462960] [2022-12-14 03:10:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:42,971 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 03:10:42,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:42,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18462960] [2022-12-14 03:10:42,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18462960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:42,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:42,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 03:10:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935049993] [2022-12-14 03:10:42,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:42,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:10:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:10:42,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:10:42,973 INFO L87 Difference]: Start difference. First operand 70270 states and 268075 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:44,146 INFO L93 Difference]: Finished difference Result 83010 states and 316492 transitions. [2022-12-14 03:10:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:10:44,147 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 03:10:44,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:44,491 INFO L225 Difference]: With dead ends: 83010 [2022-12-14 03:10:44,491 INFO L226 Difference]: Without dead ends: 83010 [2022-12-14 03:10:44,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-12-14 03:10:44,492 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 337 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:44,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 76 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:10:44,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83010 states. [2022-12-14 03:10:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83010 to 78310. [2022-12-14 03:10:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78310 states, 78297 states have (on average 3.829112226522089) internal successors, (299808), 78309 states have internal predecessors, (299808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78310 states to 78310 states and 299808 transitions. [2022-12-14 03:10:46,340 INFO L78 Accepts]: Start accepts. Automaton has 78310 states and 299808 transitions. Word has length 35 [2022-12-14 03:10:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:46,340 INFO L495 AbstractCegarLoop]: Abstraction has 78310 states and 299808 transitions. [2022-12-14 03:10:46,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 78310 states and 299808 transitions. [2022-12-14 03:10:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 03:10:46,372 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:46,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:46,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 03:10:46,372 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:46,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:46,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1019525641, now seen corresponding path program 1 times [2022-12-14 03:10:46,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:46,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904556908] [2022-12-14 03:10:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:46,845 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 03:10:46,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904556908] [2022-12-14 03:10:46,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904556908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:46,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:46,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 03:10:46,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844332861] [2022-12-14 03:10:46,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:46,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 03:10:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:46,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 03:10:46,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-14 03:10:46,846 INFO L87 Difference]: Start difference. First operand 78310 states and 299808 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:49,510 INFO L93 Difference]: Finished difference Result 265311 states and 1013810 transitions. [2022-12-14 03:10:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:10:49,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 03:10:49,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:50,844 INFO L225 Difference]: With dead ends: 265311 [2022-12-14 03:10:50,844 INFO L226 Difference]: Without dead ends: 265031 [2022-12-14 03:10:50,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-12-14 03:10:50,845 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 623 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:50,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 125 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 03:10:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265031 states. [2022-12-14 03:10:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265031 to 116874. [2022-12-14 03:10:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116874 states, 116861 states have (on average 3.90388581305996) internal successors, (456212), 116873 states have internal predecessors, (456212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116874 states to 116874 states and 456212 transitions. [2022-12-14 03:10:54,903 INFO L78 Accepts]: Start accepts. Automaton has 116874 states and 456212 transitions. Word has length 35 [2022-12-14 03:10:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:10:54,903 INFO L495 AbstractCegarLoop]: Abstraction has 116874 states and 456212 transitions. [2022-12-14 03:10:54,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 116874 states and 456212 transitions. [2022-12-14 03:10:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 03:10:55,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:10:55,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:10:55,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 03:10:55,217 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:10:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:10:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1108936069, now seen corresponding path program 1 times [2022-12-14 03:10:55,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:10:55,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368213771] [2022-12-14 03:10:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:10:55,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:10:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:10:55,697 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 03:10:55,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:10:55,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368213771] [2022-12-14 03:10:55,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368213771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:10:55,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:10:55,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 03:10:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215017303] [2022-12-14 03:10:55,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:10:55,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 03:10:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:10:55,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 03:10:55,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-14 03:10:55,699 INFO L87 Difference]: Start difference. First operand 116874 states and 456212 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:10:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:10:57,359 INFO L93 Difference]: Finished difference Result 132398 states and 514730 transitions. [2022-12-14 03:10:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:10:57,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 03:10:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:10:57,900 INFO L225 Difference]: With dead ends: 132398 [2022-12-14 03:10:57,901 INFO L226 Difference]: Without dead ends: 132398 [2022-12-14 03:10:57,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-12-14 03:10:57,901 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 400 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:10:57,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 89 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 03:10:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132398 states. [2022-12-14 03:11:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132398 to 127251. [2022-12-14 03:11:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127251 states, 127238 states have (on average 3.9020025464090917) internal successors, (496483), 127250 states have internal predecessors, (496483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127251 states to 127251 states and 496483 transitions. [2022-12-14 03:11:01,223 INFO L78 Accepts]: Start accepts. Automaton has 127251 states and 496483 transitions. Word has length 35 [2022-12-14 03:11:01,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:01,223 INFO L495 AbstractCegarLoop]: Abstraction has 127251 states and 496483 transitions. [2022-12-14 03:11:01,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 127251 states and 496483 transitions. [2022-12-14 03:11:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 03:11:01,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:01,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:01,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 03:11:01,286 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash -687814349, now seen corresponding path program 2 times [2022-12-14 03:11:01,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:01,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455811233] [2022-12-14 03:11:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:01,825 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 03:11:01,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455811233] [2022-12-14 03:11:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455811233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:01,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:01,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 03:11:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493098437] [2022-12-14 03:11:01,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:01,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 03:11:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:01,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 03:11:01,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 03:11:01,826 INFO L87 Difference]: Start difference. First operand 127251 states and 496483 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:04,986 INFO L93 Difference]: Finished difference Result 390468 states and 1517578 transitions. [2022-12-14 03:11:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:11:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 03:11:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:07,161 INFO L225 Difference]: With dead ends: 390468 [2022-12-14 03:11:07,162 INFO L226 Difference]: Without dead ends: 390160 [2022-12-14 03:11:07,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-12-14 03:11:07,162 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 484 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:07,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 145 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 03:11:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390160 states. [2022-12-14 03:11:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390160 to 128847. [2022-12-14 03:11:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128847 states, 128834 states have (on average 3.9015399661580017) internal successors, (502651), 128846 states have internal predecessors, (502651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128847 states to 128847 states and 502651 transitions. [2022-12-14 03:11:12,852 INFO L78 Accepts]: Start accepts. Automaton has 128847 states and 502651 transitions. Word has length 35 [2022-12-14 03:11:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:12,852 INFO L495 AbstractCegarLoop]: Abstraction has 128847 states and 502651 transitions. [2022-12-14 03:11:12,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 128847 states and 502651 transitions. [2022-12-14 03:11:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 03:11:12,902 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:12,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:12,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 03:11:12,903 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash 786183671, now seen corresponding path program 2 times [2022-12-14 03:11:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:12,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751531686] [2022-12-14 03:11:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:13,722 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 03:11:13,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:13,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751531686] [2022-12-14 03:11:13,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751531686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:13,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:13,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 03:11:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688425506] [2022-12-14 03:11:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:13,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 03:11:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 03:11:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-14 03:11:13,724 INFO L87 Difference]: Start difference. First operand 128847 states and 502651 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:15,404 INFO L93 Difference]: Finished difference Result 123540 states and 481411 transitions. [2022-12-14 03:11:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:11:15,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 03:11:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:15,897 INFO L225 Difference]: With dead ends: 123540 [2022-12-14 03:11:15,897 INFO L226 Difference]: Without dead ends: 123260 [2022-12-14 03:11:15,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-12-14 03:11:15,898 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 367 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:15,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 103 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 03:11:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123260 states. [2022-12-14 03:11:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123260 to 64569. [2022-12-14 03:11:17,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64569 states, 64560 states have (on average 3.801982651796778) internal successors, (245456), 64568 states have internal predecessors, (245456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64569 states to 64569 states and 245456 transitions. [2022-12-14 03:11:17,973 INFO L78 Accepts]: Start accepts. Automaton has 64569 states and 245456 transitions. Word has length 35 [2022-12-14 03:11:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:17,974 INFO L495 AbstractCegarLoop]: Abstraction has 64569 states and 245456 transitions. [2022-12-14 03:11:17,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 64569 states and 245456 transitions. [2022-12-14 03:11:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 03:11:18,000 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:18,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:18,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 03:11:18,000 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:18,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash 268097483, now seen corresponding path program 3 times [2022-12-14 03:11:18,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:18,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865834572] [2022-12-14 03:11:18,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:18,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:18,272 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 03:11:18,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:18,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865834572] [2022-12-14 03:11:18,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865834572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:18,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:18,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 03:11:18,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868663250] [2022-12-14 03:11:18,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:18,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:11:18,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:18,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:11:18,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:11:18,274 INFO L87 Difference]: Start difference. First operand 64569 states and 245456 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:19,363 INFO L93 Difference]: Finished difference Result 61760 states and 234631 transitions. [2022-12-14 03:11:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:11:19,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 03:11:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:19,598 INFO L225 Difference]: With dead ends: 61760 [2022-12-14 03:11:19,598 INFO L226 Difference]: Without dead ends: 61452 [2022-12-14 03:11:19,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-12-14 03:11:19,599 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 291 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:19,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 82 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 03:11:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61452 states. [2022-12-14 03:11:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61452 to 29883. [2022-12-14 03:11:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29883 states, 29878 states have (on average 3.749113059776424) internal successors, (112016), 29882 states have internal predecessors, (112016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29883 states to 29883 states and 112016 transitions. [2022-12-14 03:11:20,431 INFO L78 Accepts]: Start accepts. Automaton has 29883 states and 112016 transitions. Word has length 35 [2022-12-14 03:11:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:20,431 INFO L495 AbstractCegarLoop]: Abstraction has 29883 states and 112016 transitions. [2022-12-14 03:11:20,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29883 states and 112016 transitions. [2022-12-14 03:11:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 03:11:20,545 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:20,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:20,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 03:11:20,545 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash 684004286, now seen corresponding path program 1 times [2022-12-14 03:11:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:20,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339063740] [2022-12-14 03:11:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:20,893 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 03:11:20,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:20,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339063740] [2022-12-14 03:11:20,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339063740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:20,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:20,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 03:11:20,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137702557] [2022-12-14 03:11:20,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:20,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 03:11:20,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:20,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 03:11:20,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-14 03:11:20,894 INFO L87 Difference]: Start difference. First operand 29883 states and 112016 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:21,879 INFO L93 Difference]: Finished difference Result 32524 states and 121720 transitions. [2022-12-14 03:11:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:11:21,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-12-14 03:11:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:21,966 INFO L225 Difference]: With dead ends: 32524 [2022-12-14 03:11:21,967 INFO L226 Difference]: Without dead ends: 32524 [2022-12-14 03:11:21,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-12-14 03:11:21,967 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 315 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:21,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 102 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 03:11:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32524 states. [2022-12-14 03:11:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32524 to 27842. [2022-12-14 03:11:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27842 states, 27837 states have (on average 3.742393217659949) internal successors, (104177), 27841 states have internal predecessors, (104177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27842 states to 27842 states and 104177 transitions. [2022-12-14 03:11:22,597 INFO L78 Accepts]: Start accepts. Automaton has 27842 states and 104177 transitions. Word has length 37 [2022-12-14 03:11:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:22,597 INFO L495 AbstractCegarLoop]: Abstraction has 27842 states and 104177 transitions. [2022-12-14 03:11:22,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 27842 states and 104177 transitions. [2022-12-14 03:11:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 03:11:22,619 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:22,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:22,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 03:11:22,619 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1999426390, now seen corresponding path program 1 times [2022-12-14 03:11:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:22,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137393259] [2022-12-14 03:11:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:23,003 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 03:11:23,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:23,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137393259] [2022-12-14 03:11:23,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137393259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:23,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:23,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 03:11:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841396414] [2022-12-14 03:11:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:23,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 03:11:23,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:23,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 03:11:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-14 03:11:23,005 INFO L87 Difference]: Start difference. First operand 27842 states and 104177 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:24,042 INFO L93 Difference]: Finished difference Result 32412 states and 121146 transitions. [2022-12-14 03:11:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:11:24,043 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-12-14 03:11:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:24,131 INFO L225 Difference]: With dead ends: 32412 [2022-12-14 03:11:24,131 INFO L226 Difference]: Without dead ends: 32412 [2022-12-14 03:11:24,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-12-14 03:11:24,132 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 395 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:24,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 97 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 03:11:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32412 states. [2022-12-14 03:11:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32412 to 27247. [2022-12-14 03:11:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27247 states, 27242 states have (on average 3.745796931209162) internal successors, (102043), 27246 states have internal predecessors, (102043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27247 states to 27247 states and 102043 transitions. [2022-12-14 03:11:24,731 INFO L78 Accepts]: Start accepts. Automaton has 27247 states and 102043 transitions. Word has length 37 [2022-12-14 03:11:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:24,732 INFO L495 AbstractCegarLoop]: Abstraction has 27247 states and 102043 transitions. [2022-12-14 03:11:24,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 27247 states and 102043 transitions. [2022-12-14 03:11:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 03:11:24,757 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:24,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:24,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 03:11:24,757 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1732734551, now seen corresponding path program 1 times [2022-12-14 03:11:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:24,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53934586] [2022-12-14 03:11:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:25,194 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 03:11:25,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:25,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53934586] [2022-12-14 03:11:25,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53934586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:25,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:25,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 03:11:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341072230] [2022-12-14 03:11:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:25,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 03:11:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:25,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 03:11:25,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-14 03:11:25,196 INFO L87 Difference]: Start difference. First operand 27247 states and 102043 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:26,165 INFO L93 Difference]: Finished difference Result 34789 states and 130864 transitions. [2022-12-14 03:11:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:11:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-12-14 03:11:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:26,260 INFO L225 Difference]: With dead ends: 34789 [2022-12-14 03:11:26,260 INFO L226 Difference]: Without dead ends: 34789 [2022-12-14 03:11:26,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-12-14 03:11:26,261 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 368 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:26,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 82 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 03:11:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34789 states. [2022-12-14 03:11:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34789 to 31621. [2022-12-14 03:11:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31621 states, 31616 states have (on average 3.7889359817813766) internal successors, (119791), 31620 states have internal predecessors, (119791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31621 states to 31621 states and 119791 transitions. [2022-12-14 03:11:26,891 INFO L78 Accepts]: Start accepts. Automaton has 31621 states and 119791 transitions. Word has length 40 [2022-12-14 03:11:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:26,892 INFO L495 AbstractCegarLoop]: Abstraction has 31621 states and 119791 transitions. [2022-12-14 03:11:26,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 31621 states and 119791 transitions. [2022-12-14 03:11:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 03:11:26,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:26,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:26,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 03:11:26,925 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:26,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:26,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1769924846, now seen corresponding path program 1 times [2022-12-14 03:11:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:26,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126984509] [2022-12-14 03:11:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:26,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:27,503 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 03:11:27,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:27,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126984509] [2022-12-14 03:11:27,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126984509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:27,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:27,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 03:11:27,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322491937] [2022-12-14 03:11:27,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:27,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 03:11:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:27,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 03:11:27,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-14 03:11:27,505 INFO L87 Difference]: Start difference. First operand 31621 states and 119791 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:28,783 INFO L93 Difference]: Finished difference Result 31298 states and 118468 transitions. [2022-12-14 03:11:28,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:11:28,783 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-12-14 03:11:28,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:28,867 INFO L225 Difference]: With dead ends: 31298 [2022-12-14 03:11:28,867 INFO L226 Difference]: Without dead ends: 31298 [2022-12-14 03:11:28,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-12-14 03:11:28,867 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 389 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:28,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 112 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 03:11:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31298 states. [2022-12-14 03:11:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31298 to 19714. [2022-12-14 03:11:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19714 states, 19709 states have (on average 3.680196864376681) internal successors, (72533), 19713 states have internal predecessors, (72533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19714 states to 19714 states and 72533 transitions. [2022-12-14 03:11:29,312 INFO L78 Accepts]: Start accepts. Automaton has 19714 states and 72533 transitions. Word has length 42 [2022-12-14 03:11:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:29,312 INFO L495 AbstractCegarLoop]: Abstraction has 19714 states and 72533 transitions. [2022-12-14 03:11:29,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 19714 states and 72533 transitions. [2022-12-14 03:11:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 03:11:29,336 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:29,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:29,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 03:11:29,336 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1196541921, now seen corresponding path program 1 times [2022-12-14 03:11:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:29,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694338540] [2022-12-14 03:11:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:29,419 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 03:11:29,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:29,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694338540] [2022-12-14 03:11:29,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694338540] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:11:29,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910253218] [2022-12-14 03:11:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:29,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:11:29,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:11:29,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:11:29,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 03:11:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:29,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 03:11:29,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:11:29,628 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 03:11:29,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:11:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 03:11:29,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910253218] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 03:11:29,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:11:29,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-14 03:11:29,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980154175] [2022-12-14 03:11:29,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:29,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:11:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:29,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:11:29,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:11:29,657 INFO L87 Difference]: Start difference. First operand 19714 states and 72533 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:29,829 INFO L93 Difference]: Finished difference Result 22978 states and 85081 transitions. [2022-12-14 03:11:29,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:11:29,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-12-14 03:11:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:29,885 INFO L225 Difference]: With dead ends: 22978 [2022-12-14 03:11:29,885 INFO L226 Difference]: Without dead ends: 22978 [2022-12-14 03:11:29,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-14 03:11:29,886 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 119 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:29,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 104 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:11:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22978 states. [2022-12-14 03:11:30,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22978 to 22978. [2022-12-14 03:11:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22978 states, 22973 states have (on average 3.7035215252687936) internal successors, (85081), 22977 states have internal predecessors, (85081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22978 states to 22978 states and 85081 transitions. [2022-12-14 03:11:30,310 INFO L78 Accepts]: Start accepts. Automaton has 22978 states and 85081 transitions. Word has length 42 [2022-12-14 03:11:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:30,310 INFO L495 AbstractCegarLoop]: Abstraction has 22978 states and 85081 transitions. [2022-12-14 03:11:30,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 22978 states and 85081 transitions. [2022-12-14 03:11:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 03:11:30,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:30,341 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:30,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 03:11:30,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:11:30,543 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:30,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash 609596956, now seen corresponding path program 1 times [2022-12-14 03:11:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:30,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343660105] [2022-12-14 03:11:30,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:30,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 03:11:30,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:30,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343660105] [2022-12-14 03:11:30,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343660105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:30,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:30,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 03:11:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964549218] [2022-12-14 03:11:30,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:30,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 03:11:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:30,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 03:11:30,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-14 03:11:30,990 INFO L87 Difference]: Start difference. First operand 22978 states and 85081 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:31,731 INFO L93 Difference]: Finished difference Result 27896 states and 103290 transitions. [2022-12-14 03:11:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:11:31,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 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 50 [2022-12-14 03:11:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:31,802 INFO L225 Difference]: With dead ends: 27896 [2022-12-14 03:11:31,802 INFO L226 Difference]: Without dead ends: 27896 [2022-12-14 03:11:31,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-12-14 03:11:31,803 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 334 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:31,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 72 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:11:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27896 states. [2022-12-14 03:11:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27896 to 24649. [2022-12-14 03:11:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24649 states, 24644 states have (on average 3.6958691770816428) internal successors, (91081), 24648 states have internal predecessors, (91081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24649 states to 24649 states and 91081 transitions. [2022-12-14 03:11:32,329 INFO L78 Accepts]: Start accepts. Automaton has 24649 states and 91081 transitions. Word has length 50 [2022-12-14 03:11:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:32,329 INFO L495 AbstractCegarLoop]: Abstraction has 24649 states and 91081 transitions. [2022-12-14 03:11:32,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 24649 states and 91081 transitions. [2022-12-14 03:11:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 03:11:32,364 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:32,364 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:32,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 03:11:32,365 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1560843544, now seen corresponding path program 1 times [2022-12-14 03:11:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:32,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569517539] [2022-12-14 03:11:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 03:11:32,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569517539] [2022-12-14 03:11:32,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569517539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:32,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:32,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 03:11:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393609855] [2022-12-14 03:11:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:32,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:11:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:11:32,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:11:32,680 INFO L87 Difference]: Start difference. First operand 24649 states and 91081 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:33,188 INFO L93 Difference]: Finished difference Result 24334 states and 90132 transitions. [2022-12-14 03:11:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:11:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 50 [2022-12-14 03:11:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:33,250 INFO L225 Difference]: With dead ends: 24334 [2022-12-14 03:11:33,250 INFO L226 Difference]: Without dead ends: 24294 [2022-12-14 03:11:33,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-12-14 03:11:33,250 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 248 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:33,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 69 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 03:11:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24294 states. [2022-12-14 03:11:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24294 to 23236. [2022-12-14 03:11:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23236 states, 23233 states have (on average 3.738174148840012) internal successors, (86849), 23235 states have internal predecessors, (86849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23236 states to 23236 states and 86849 transitions. [2022-12-14 03:11:33,726 INFO L78 Accepts]: Start accepts. Automaton has 23236 states and 86849 transitions. Word has length 50 [2022-12-14 03:11:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:33,726 INFO L495 AbstractCegarLoop]: Abstraction has 23236 states and 86849 transitions. [2022-12-14 03:11:33,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 23236 states and 86849 transitions. [2022-12-14 03:11:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 03:11:33,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:33,759 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:33,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 03:11:33,759 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1028499398, now seen corresponding path program 2 times [2022-12-14 03:11:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:33,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950203098] [2022-12-14 03:11:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 03:11:34,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:34,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950203098] [2022-12-14 03:11:34,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950203098] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:11:34,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402659843] [2022-12-14 03:11:34,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:11:34,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:11:34,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:11:34,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:11:34,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 03:11:34,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 03:11:34,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:11:34,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 03:11:34,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:11:34,645 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 03:11:34,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-12-14 03:11:34,680 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 03:11:34,680 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 12 treesize of output 14 [2022-12-14 03:11:34,712 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 03:11:34,712 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 03:11:34,867 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 15 treesize of output 11 [2022-12-14 03:11:34,894 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 28 treesize of output 27 [2022-12-14 03:11:34,940 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 30 treesize of output 30 [2022-12-14 03:11:34,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:11:34,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 03:11:35,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:11:35,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 03:11:35,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:11:35,071 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 54 treesize of output 50 [2022-12-14 03:11:35,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:11:35,085 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 54 treesize of output 50 [2022-12-14 03:11:35,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:11:35,102 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 54 treesize of output 50 [2022-12-14 03:11:35,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:11:35,161 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 54 treesize of output 50 [2022-12-14 03:11:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 03:11:35,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:11:35,189 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (and (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse0 3 c_~C~0.offset)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse0 2 c_~C~0.offset)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse0 c_~C~0.offset 1)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse0 c_~C~0.offset)) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)))) is different from false [2022-12-14 03:11:35,237 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (and (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse0 2 c_~C~0.offset)))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse0 3 c_~C~0.offset)) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse0 c_~C~0.offset)))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse0 c_~C~0.offset 1)) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)))) is different from false [2022-12-14 03:11:35,476 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (+ .cse2 2 c_~C~0.offset)) (.cse1 (+ .cse2 3 c_~C~0.offset))) (let ((.cse0 (store |c_#race| c_~C~0.base (store (store (select |c_#race| c_~C~0.base) .cse3 |c_thread3Thread1of1ForFork1_#t~nondet13#1|) .cse1 |c_thread3Thread1of1ForFork1_#t~nondet13#1|)))) (and (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) .cse1))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse2 c_~C~0.offset)))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) .cse3))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2020) c_~C~0.base) (+ .cse2 c_~C~0.offset 1)))))))) is different from false [2022-12-14 03:11:35,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:11:35,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 70 [2022-12-14 03:11:35,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:11:35,907 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 349 treesize of output 216 [2022-12-14 03:11:35,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 134 [2022-12-14 03:11:35,918 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 192 treesize of output 174 [2022-12-14 03:11:35,921 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 174 treesize of output 138 [2022-12-14 03:11:35,975 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-14 03:11:35,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 1 [2022-12-14 03:11:35,981 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-14 03:11:35,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 1 [2022-12-14 03:11:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-12-14 03:11:36,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402659843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:11:36,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1035767550] [2022-12-14 03:11:36,266 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 03:11:36,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:11:36,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-12-14 03:11:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685464303] [2022-12-14 03:11:36,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:11:36,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 03:11:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:36,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 03:11:36,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=544, Unknown=56, NotChecked=156, Total=870 [2022-12-14 03:11:36,269 INFO L87 Difference]: Start difference. First operand 23236 states and 86849 transitions. Second operand has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 29 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:41,122 INFO L93 Difference]: Finished difference Result 28689 states and 107321 transitions. [2022-12-14 03:11:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:11:41,122 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 29 states have internal predecessors, (117), 0 states have call successors, (0), 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 50 [2022-12-14 03:11:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:41,201 INFO L225 Difference]: With dead ends: 28689 [2022-12-14 03:11:41,201 INFO L226 Difference]: Without dead ends: 28689 [2022-12-14 03:11:41,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=276, Invalid=870, Unknown=56, NotChecked=204, Total=1406 [2022-12-14 03:11:41,202 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 712 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 593 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:41,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 165 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1813 Invalid, 0 Unknown, 593 Unchecked, 2.1s Time] [2022-12-14 03:11:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28689 states. [2022-12-14 03:11:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28689 to 25107. [2022-12-14 03:11:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25107 states, 25104 states have (on average 3.7482074569789674) internal successors, (94095), 25106 states have internal predecessors, (94095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25107 states to 25107 states and 94095 transitions. [2022-12-14 03:11:41,737 INFO L78 Accepts]: Start accepts. Automaton has 25107 states and 94095 transitions. Word has length 50 [2022-12-14 03:11:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:41,737 INFO L495 AbstractCegarLoop]: Abstraction has 25107 states and 94095 transitions. [2022-12-14 03:11:41,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 29 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 25107 states and 94095 transitions. [2022-12-14 03:11:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 03:11:41,777 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:41,777 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:11:41,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 03:11:41,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 03:11:41,978 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash 597559206, now seen corresponding path program 1 times [2022-12-14 03:11:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:41,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137191265] [2022-12-14 03:11:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 03:11:42,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:42,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137191265] [2022-12-14 03:11:42,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137191265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:42,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:42,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 03:11:42,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420577501] [2022-12-14 03:11:42,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:42,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 03:11:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:42,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 03:11:42,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-14 03:11:42,619 INFO L87 Difference]: Start difference. First operand 25107 states and 94095 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:43,686 INFO L93 Difference]: Finished difference Result 31153 states and 116858 transitions. [2022-12-14 03:11:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:11:43,686 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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 55 [2022-12-14 03:11:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:43,768 INFO L225 Difference]: With dead ends: 31153 [2022-12-14 03:11:43,768 INFO L226 Difference]: Without dead ends: 31153 [2022-12-14 03:11:43,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-12-14 03:11:43,769 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 297 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:43,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 87 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 03:11:43,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31153 states. [2022-12-14 03:11:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31153 to 26835. [2022-12-14 03:11:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26835 states, 26832 states have (on average 3.771578711985689) internal successors, (101199), 26834 states have internal predecessors, (101199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26835 states to 26835 states and 101199 transitions. [2022-12-14 03:11:44,327 INFO L78 Accepts]: Start accepts. Automaton has 26835 states and 101199 transitions. Word has length 55 [2022-12-14 03:11:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:44,327 INFO L495 AbstractCegarLoop]: Abstraction has 26835 states and 101199 transitions. [2022-12-14 03:11:44,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 26835 states and 101199 transitions. [2022-12-14 03:11:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 03:11:44,374 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:44,374 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:11:44,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 03:11:44,374 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1356179784, now seen corresponding path program 2 times [2022-12-14 03:11:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:44,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393865409] [2022-12-14 03:11:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:44,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 03:11:45,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:45,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393865409] [2022-12-14 03:11:45,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393865409] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:11:45,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171933568] [2022-12-14 03:11:45,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:11:45,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:11:45,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:11:45,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:11:45,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 03:11:45,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 03:11:45,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:11:45,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 03:11:45,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:11:45,377 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 03:11:45,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-12-14 03:11:45,400 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 03:11:45,400 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 12 treesize of output 14 [2022-12-14 03:11:45,423 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 03:11:45,424 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 03:11:45,664 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 15 treesize of output 11 [2022-12-14 03:11:45,697 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 28 treesize of output 27 [2022-12-14 03:11:45,739 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 30 treesize of output 30 [2022-12-14 03:11:45,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:11:45,793 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 40 treesize of output 42 [2022-12-14 03:11:45,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:11:45,846 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 52 treesize of output 57 [2022-12-14 03:11:45,961 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 54 treesize of output 50 [2022-12-14 03:11:46,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:11:46,017 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 54 treesize of output 50 [2022-12-14 03:11:46,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:11:46,042 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 54 treesize of output 50 [2022-12-14 03:11:46,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:11:46,069 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 54 treesize of output 50 [2022-12-14 03:11:46,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:11:46,161 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 54 treesize of output 50 [2022-12-14 03:11:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 03:11:46,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:11:46,199 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (and (forall ((v_ArrVal_2312 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse0 2 c_~C~0.offset)))) (forall ((v_ArrVal_2312 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse0 3 c_~C~0.offset)))) (forall ((v_ArrVal_2312 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse0 c_~C~0.offset)))) (forall ((v_ArrVal_2312 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse0 c_~C~0.offset 1)))))) is different from false [2022-12-14 03:11:46,252 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (and (forall ((v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse0 c_~C~0.offset)))) (forall ((v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse0 3 c_~C~0.offset)) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)) (forall ((v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse0 2 c_~C~0.offset)))) (forall ((v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse0 c_~C~0.offset 1)) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)))) is different from false [2022-12-14 03:11:52,780 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (+ .cse2 2 c_~C~0.offset)) (.cse3 (+ .cse2 3 c_~C~0.offset))) (let ((.cse0 (store |c_#race| c_~C~0.base (store (store (select |c_#race| c_~C~0.base) .cse1 |c_thread3Thread1of1ForFork1_#t~nondet13#1|) .cse3 |c_thread3Thread1of1ForFork1_#t~nondet13#1|)))) (and (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2308) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) .cse1))) (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2308) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse2 c_~C~0.offset 1)))) (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2308) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) (+ .cse2 c_~C~0.offset)))) (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2308) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2312) c_~C~0.base) .cse3))))))) is different from false [2022-12-14 03:11:53,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:11:53,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 73 [2022-12-14 03:11:53,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:11:53,377 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 839 treesize of output 582 [2022-12-14 03:11:53,391 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 570 treesize of output 546 [2022-12-14 03:11:53,396 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 546 treesize of output 450 [2022-12-14 03:11:53,401 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 450 treesize of output 402 [2022-12-14 03:11:53,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 202 [2022-12-14 03:11:53,811 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-14 03:11:53,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 1 [2022-12-14 03:11:53,818 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-14 03:11:53,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 1 [2022-12-14 03:11:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 03:11:54,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171933568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:11:54,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277026296] [2022-12-14 03:11:54,223 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 03:11:54,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:11:54,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-12-14 03:11:54,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123804751] [2022-12-14 03:11:54,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:11:54,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 03:11:54,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:54,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 03:11:54,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=628, Unknown=64, NotChecked=168, Total=992 [2022-12-14 03:11:54,225 INFO L87 Difference]: Start difference. First operand 26835 states and 101199 transitions. Second operand has 32 states, 31 states have (on average 4.064516129032258) internal successors, (126), 31 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:56,538 INFO L93 Difference]: Finished difference Result 26796 states and 101082 transitions. [2022-12-14 03:11:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:11:56,539 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.064516129032258) internal successors, (126), 31 states have internal predecessors, (126), 0 states have call successors, (0), 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 55 [2022-12-14 03:11:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:56,711 INFO L225 Difference]: With dead ends: 26796 [2022-12-14 03:11:56,711 INFO L226 Difference]: Without dead ends: 26796 [2022-12-14 03:11:56,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=256, Invalid=947, Unknown=69, NotChecked=210, Total=1482 [2022-12-14 03:11:56,712 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 506 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 693 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:56,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 111 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1228 Invalid, 0 Unknown, 693 Unchecked, 1.6s Time] [2022-12-14 03:11:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26796 states. [2022-12-14 03:11:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26796 to 21488. [2022-12-14 03:11:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21488 states, 21485 states have (on average 3.754991854782406) internal successors, (80676), 21487 states have internal predecessors, (80676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21488 states to 21488 states and 80676 transitions. [2022-12-14 03:11:57,128 INFO L78 Accepts]: Start accepts. Automaton has 21488 states and 80676 transitions. Word has length 55 [2022-12-14 03:11:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:57,128 INFO L495 AbstractCegarLoop]: Abstraction has 21488 states and 80676 transitions. [2022-12-14 03:11:57,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.064516129032258) internal successors, (126), 31 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 21488 states and 80676 transitions. [2022-12-14 03:11:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 03:11:57,162 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:57,162 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:57,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 03:11:57,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-14 03:11:57,363 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -848924589, now seen corresponding path program 1 times [2022-12-14 03:11:57,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:57,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384958539] [2022-12-14 03:11:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:57,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 03:11:57,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:57,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384958539] [2022-12-14 03:11:57,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384958539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:11:57,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598013330] [2022-12-14 03:11:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:57,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:11:57,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:11:57,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:11:57,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 03:11:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:57,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 03:11:57,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:11:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 03:11:57,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:11:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 03:11:57,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598013330] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 03:11:57,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:11:57,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-14 03:11:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982752969] [2022-12-14 03:11:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:57,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:11:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:57,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:11:57,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:11:57,734 INFO L87 Difference]: Start difference. First operand 21488 states and 80676 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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 03:11:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:11:57,981 INFO L93 Difference]: Finished difference Result 25722 states and 96690 transitions. [2022-12-14 03:11:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:11:57,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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 60 [2022-12-14 03:11:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:11:58,052 INFO L225 Difference]: With dead ends: 25722 [2022-12-14 03:11:58,052 INFO L226 Difference]: Without dead ends: 25722 [2022-12-14 03:11:58,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-14 03:11:58,053 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 123 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:11:58,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 107 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:11:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25722 states. [2022-12-14 03:11:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25722 to 25722. [2022-12-14 03:11:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25722 states, 25719 states have (on average 3.7594774291379913) internal successors, (96690), 25721 states have internal predecessors, (96690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:11:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25722 states to 25722 states and 96690 transitions. [2022-12-14 03:11:58,557 INFO L78 Accepts]: Start accepts. Automaton has 25722 states and 96690 transitions. Word has length 60 [2022-12-14 03:11:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:11:58,558 INFO L495 AbstractCegarLoop]: Abstraction has 25722 states and 96690 transitions. [2022-12-14 03:11:58,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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 03:11:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25722 states and 96690 transitions. [2022-12-14 03:11:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 03:11:58,603 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:11:58,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:11:58,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 03:11:58,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:11:58,804 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:11:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:11:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash -201060887, now seen corresponding path program 1 times [2022-12-14 03:11:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:11:58,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809493239] [2022-12-14 03:11:58,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:11:58,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:11:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:11:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 03:11:59,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:11:59,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809493239] [2022-12-14 03:11:59,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809493239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:11:59,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:11:59,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 03:11:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102574808] [2022-12-14 03:11:59,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:11:59,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 03:11:59,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:11:59,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 03:11:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-14 03:11:59,539 INFO L87 Difference]: Start difference. First operand 25722 states and 96690 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:12:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:12:00,532 INFO L93 Difference]: Finished difference Result 30916 states and 116272 transitions. [2022-12-14 03:12:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:12:00,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 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 68 [2022-12-14 03:12:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:12:00,612 INFO L225 Difference]: With dead ends: 30916 [2022-12-14 03:12:00,612 INFO L226 Difference]: Without dead ends: 30912 [2022-12-14 03:12:00,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-12-14 03:12:00,613 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 306 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 03:12:00,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 92 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 03:12:00,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30912 states. [2022-12-14 03:12:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30912 to 26302. [2022-12-14 03:12:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26302 states, 26299 states have (on average 3.756568690824746) internal successors, (98794), 26301 states have internal predecessors, (98794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:12:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26302 states to 26302 states and 98794 transitions. [2022-12-14 03:12:01,200 INFO L78 Accepts]: Start accepts. Automaton has 26302 states and 98794 transitions. Word has length 68 [2022-12-14 03:12:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:12:01,200 INFO L495 AbstractCegarLoop]: Abstraction has 26302 states and 98794 transitions. [2022-12-14 03:12:01,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:12:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 26302 states and 98794 transitions. [2022-12-14 03:12:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 03:12:01,246 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:12:01,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:12:01,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 03:12:01,246 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:12:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:12:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -903551034, now seen corresponding path program 1 times [2022-12-14 03:12:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:12:01,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110606577] [2022-12-14 03:12:01,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:12:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 03:12:01,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:12:01,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110606577] [2022-12-14 03:12:01,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110606577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:12:01,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:12:01,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 03:12:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367868800] [2022-12-14 03:12:01,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:12:01,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 03:12:01,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:12:01,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 03:12:01,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-14 03:12:01,704 INFO L87 Difference]: Start difference. First operand 26302 states and 98794 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:12:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:12:02,281 INFO L93 Difference]: Finished difference Result 26275 states and 98740 transitions. [2022-12-14 03:12:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:12:02,281 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 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 68 [2022-12-14 03:12:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:12:02,348 INFO L225 Difference]: With dead ends: 26275 [2022-12-14 03:12:02,348 INFO L226 Difference]: Without dead ends: 25721 [2022-12-14 03:12:02,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-12-14 03:12:02,349 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 128 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:12:02,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 74 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 03:12:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25721 states. [2022-12-14 03:12:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25721 to 24731. [2022-12-14 03:12:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24731 states, 24730 states have (on average 3.8139506672058228) internal successors, (94319), 24730 states have internal predecessors, (94319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:12:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24731 states to 24731 states and 94319 transitions. [2022-12-14 03:12:02,848 INFO L78 Accepts]: Start accepts. Automaton has 24731 states and 94319 transitions. Word has length 68 [2022-12-14 03:12:02,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:12:02,849 INFO L495 AbstractCegarLoop]: Abstraction has 24731 states and 94319 transitions. [2022-12-14 03:12:02,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:12:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 24731 states and 94319 transitions. [2022-12-14 03:12:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 03:12:02,893 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:12:02,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:12:02,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-14 03:12:02,893 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-12-14 03:12:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:12:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1626369547, now seen corresponding path program 2 times [2022-12-14 03:12:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:12:02,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954915721] [2022-12-14 03:12:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:12:02,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:12:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:12:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 03:12:03,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:12:03,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954915721] [2022-12-14 03:12:03,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954915721] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:12:03,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821114242] [2022-12-14 03:12:03,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:12:03,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:12:03,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:12:03,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:12:03,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ac52070-de8d-41ae-8e17-69d186bf958b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 03:12:03,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 03:12:03,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:12:03,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 03:12:03,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:12:03,967 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 03:12:03,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-12-14 03:12:04,006 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 03:12:04,006 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 03:12:04,026 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 03:12:04,026 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 03:12:04,284 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 15 treesize of output 11 [2022-12-14 03:12:04,322 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 28 treesize of output 27 [2022-12-14 03:12:04,369 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 30 treesize of output 30 [2022-12-14 03:12:04,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:12:04,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 03:12:04,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:12:04,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 03:12:04,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:04,558 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 54 treesize of output 50 [2022-12-14 03:12:04,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:04,579 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 54 treesize of output 50 [2022-12-14 03:12:04,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:04,602 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 54 treesize of output 50 [2022-12-14 03:12:04,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:04,685 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 54 treesize of output 50 [2022-12-14 03:12:04,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:04,701 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 54 treesize of output 50 [2022-12-14 03:12:04,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:04,723 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 54 treesize of output 50 [2022-12-14 03:12:04,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:04,742 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 54 treesize of output 50 [2022-12-14 03:12:04,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:12:04,817 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 54 treesize of output 50 [2022-12-14 03:12:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 03:12:04,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:12:04,854 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (and (forall ((v_ArrVal_2948 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse0 2 c_~C~0.offset)))) (forall ((v_ArrVal_2948 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse0 c_~C~0.offset 1)) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)) (forall ((v_ArrVal_2948 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse0 3 c_~C~0.offset)))) (forall ((v_ArrVal_2948 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse0 c_~C~0.offset)))))) is different from false [2022-12-14 03:12:04,903 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (and (forall ((v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse0 c_~C~0.offset 1)))) (forall ((v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse0 3 c_~C~0.offset)))) (forall ((v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse0 c_~C~0.offset)))) (forall ((v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse0 2 c_~C~0.offset)))))) is different from false [2022-12-14 03:12:07,573 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse3 (+ .cse1 2 c_~C~0.offset)) (.cse2 (+ .cse1 3 c_~C~0.offset))) (let ((.cse0 (store |c_#race| c_~C~0.base (store (store (select |c_#race| c_~C~0.base) .cse3 |c_thread3Thread1of1ForFork1_#t~nondet13#1|) .cse2 |c_thread3Thread1of1ForFork1_#t~nondet13#1|)))) (and (forall ((v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse1 c_~C~0.offset)) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)) (forall ((v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) .cse2) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)) (forall ((v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse1 c_~C~0.offset 1)) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)) (forall ((v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) .cse3))))))) is different from false [2022-12-14 03:12:07,599 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) (let ((.cse1 (+ .cse3 2 c_~C~0.offset)) (.cse2 (+ .cse3 3 c_~C~0.offset))) (and (forall ((v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2936 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_2936))) (store .cse0 c_~C~0.base (store (store (select .cse0 c_~C~0.base) .cse1 |c_thread3Thread1of1ForFork1_#t~nondet13#1|) .cse2 |c_thread3Thread1of1ForFork1_#t~nondet13#1|))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse3 c_~C~0.offset)))) (forall ((v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2936 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_2936))) (store .cse4 c_~C~0.base (store (store (select .cse4 c_~C~0.base) .cse1 |c_thread3Thread1of1ForFork1_#t~nondet13#1|) .cse2 |c_thread3Thread1of1ForFork1_#t~nondet13#1|))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) .cse1))) (forall ((v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2936 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= (select (select (store (store (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_2936))) (store .cse5 c_~C~0.base (store (store (select .cse5 c_~C~0.base) .cse1 |c_thread3Thread1of1ForFork1_#t~nondet13#1|) .cse2 |c_thread3Thread1of1ForFork1_#t~nondet13#1|))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) .cse2) |c_thread3Thread1of1ForFork1_#t~nondet13#1|)) (forall ((v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2936 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (= |c_thread3Thread1of1ForFork1_#t~nondet13#1| (select (select (store (store (store (let ((.cse6 (store |c_#race| c_~A~0.base v_ArrVal_2936))) (store .cse6 c_~C~0.base (store (store (select .cse6 c_~C~0.base) .cse1 |c_thread3Thread1of1ForFork1_#t~nondet13#1|) .cse2 |c_thread3Thread1of1ForFork1_#t~nondet13#1|))) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2943) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2947) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2948) c_~C~0.base) (+ .cse3 c_~C~0.offset 1))))))) is different from false [2022-12-14 03:12:07,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:12:07,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 74 [2022-12-14 03:12:07,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:12:07,968 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 2715 treesize of output 1858 [2022-12-14 03:12:08,009 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 1790 treesize of output 1622 [2022-12-14 03:12:08,022 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 578 treesize of output 550 [2022-12-14 03:12:08,031 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 1594 treesize of output 1510 [2022-12-14 03:12:08,040 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 1510 treesize of output 1174 [2022-12-14 03:12:09,781 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-14 03:12:09,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 1 [2022-12-14 03:12:09,789 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-14 03:12:09,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 1 [2022-12-14 03:12:09,795 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-14 03:12:09,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 1 [2022-12-14 03:12:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 03:12:10,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821114242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:12:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1407724568] [2022-12-14 03:12:10,326 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 03:12:10,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:12:10,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-12-14 03:12:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765748033] [2022-12-14 03:12:10,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:12:10,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 03:12:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:12:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 03:12:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=615, Unknown=39, NotChecked=220, Total=992 [2022-12-14 03:12:10,328 INFO L87 Difference]: Start difference. First operand 24731 states and 94319 transitions. Second operand has 32 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)